Problem Statement

You are given a sequence of $N$ positive integers: A=(A1​,A2​,…,AN​). Determine whether there is a pair of sequences B=(B1​,B2​,…,Bx​),C=(C1​,C2​,…,Cy​) satisfying all of the conditions, and print one such pair if it exists.

• $1\le x,y\le N$.
• 1≤B1​<B2​<⋯<Bx​≤N.
• 1≤C1​<C2​<⋯<Cy​≤N.
• $B$ and $C$ are different sequences.
  • Here, we consider $B$ and $C$ different when $x\ne y$ or there is an integer $i(1\le i\le \min (x,y))$ such that Bi​=Ci​.
• AB1​​+AB2​​+⋯+ABx​​ and AC1​​+AC2​​+⋯+ACy​​ are equal modulo $200$.

Constraints

• All values in input are integers.
• $2\le N\le 200$
• 1≤Ai​≤109

Sample Input 1

5
180 186 189 191 218

Sample Output 1

Yes
1 1
2 3 4

For $B=(1),C=(3,4)$, we have A1​=180, A3​+A4​=380, which are equal modulo $200$.
There are other solutions that will also be accepted, such as:

yEs
4 2 3 4 5
3 1 2 5

Sample Input 2

2
123 523

Sample Output 2

Yes
1 1
1 2

Sample Input 3

6
2013 1012 2765 2021 508 6971

Sample Output 3

No

If there is no pair of sequences satisfying the conditions, print a single line containing No.