You are given a sequence of positive integers $A = (A_1, A_2, \dots, A_N)$ of length $N$.
Determine whether there exist subsets $X, Y \subseteq \{1, 2, \dots, N\}$ that satisfy all of the following conditions. If such subsets exist, output one example.
- $0 < |X| = |Y|$
- $X$ and $Y$ are different as sets
- Let $s_X = \sum_{x \in X} \frac{1}{A_x}$ and $s_Y = \sum_{y \in Y} \frac{1}{A_y}$. Then $|s_X - s_Y| \le 10^{-5}$ holds.
Input
The input is given in the following format:
N A1 A2 ... AN
- All input values are integers.
- $2 \le N \le 1000$
- $1 \le A_i \le 10^5$
Output
If there do not exist subsets $X, Y$ satisfying the conditions, output No.
If they exist, let $M = |X| = |Y|$. Let the elements of $X$ in ascending order be $X_1, X_2, \dots, X_M$, and the elements of $Y$ in ascending order be $Y_1, Y_2, \dots, Y_M$. Output in the following format:
Yes M X1 X2 ... XM Y1 Y2 ... YM
If multiple valid pairs $X, Y$ exist, any one of them may be output.
Examples
Input 1
10 31 41 59 26 53 58 97 93 23 84
Output 1
Yes 5 1 2 5 7 9 1 2 3 4 6
Input 2
7 2 3 5 7 11 13 17
Output 2
No
Input 3
8 123 456 789 314 159 265 271 828
Output 3
Yes 4 2 4 5 7 1 2 3 6
Note
In the first example, $s_X = \frac{1}{31} + \frac{1}{59} = 0.04920721705\dots$ and $s_Y = \frac{1}{26} + \frac{1}{93} = 0.04921422663\dots$, hence $|s_X - s_Y| \le 10^{-5}$ holds.