B"Ksenia has an array a consisting of n positive integers a_1, a_2, ldots, a_n . In one operation she can do the following: She wants to make all a_i equal in at most n operations, or to determine that it is impossible to do so. She wouldn't ask for your help, but please, help her! The first line contains one integer n ( 3 <= q n <= q 10^5 ) -- the length of a . The second line contains n integers, a_1, a_2, ldots, a_n ( 1 <= q a_i <= q 10^9 ) -- elements of a . Print YES or NO in the first line depending on whether it is possible to make all elements equal in at most n operations. If it is possible, print an integer m ( 0 <= q m <= q n ), which denotes the number of operations you do. In each of the next m lines, print three distinct integers i, j, k , representing one operation. If there are many such operation sequences possible, print any. Note that you do not have to minimize the number of operations. In the first example, the array becomes [4 oplus 1 oplus 7, 2, 4 oplus 1 oplus 7, 4 oplus 1 oplus 7, 2] = [2, 2, 2, 2, 2] . "...