H. Chocolate Messages
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

After a sore defeat at the "Gift Battle", Danny decided to give up on buying a fancy gift.

Instead, he went to the most famous Chocolate Shop of Dinoland to buy Dannita some chocolate. There, he noticed that some chocolates had some letters written on them.

The shop offers $$$N$$$ types of chocolate. These types are numbered from $$$1$$$ to $$$N$$$. Each type $$$i$$$ has a string $$$S_i$$$ written on it. Danny wonders if there are $$$4$$$ distinct types of chocolate $$$i_1$$$, $$$i_2$$$, $$$i_3$$$ and $$$i_4$$$ such that $$$S_{i_1} + S_{i_2} = S_{i_3} + S_{i_4}$$$. He wants to surprise Dannita with such types of chocolate. Help him find such types of chocolate or tell him that it is impossible.

Input

The first line of input contains a single integer $$$N$$$ ($$$4 \leq N \leq 1000$$$).

The next $$$N$$$ lines contain the strings written on the types of chocolate. The $$$i+1^{\text{th}}$$$ line of the input contains $$$S_i$$$, the string written on the $$$i^{\text{th}}$$$ type of chocolate.

The sum of the length of all the strings will not exceed $$$10^6$$$.

Note that the strings will only consist of lowercase and uppercase English letters.

Output

If it is impossible to find an answer, print "NO".

Otherwise, print "YES" on a line followed on the next line by $$$4$$$ integers that satisfy the condition specified in the statement. If there are multiple answers, print any of them.

Example
Input
6
Da
nnyy
Val
entine
Valen
tine
Output
YES
3 4 5 6