You are given a string of length , consisting of the characters A, B and C. Determine if can be split into non-intersecting subsequences, each of which forms one of the strings "AB", "AC", "BC". If it is possible, find such a splitting.
The first line of input contains one integer (1 \le n \le 10^5).
The second line of input contains a string of length , consisting of the characters A, B and C.
If the splitting is not possible, print "NO" (without quotes).
If the splitting is possible, print "YES" (without quotes), followed by lines, each describing two indices for the -th subsequence (1 \le l_i < r_i \le 2n).
Example 1
Example 2
Example 3
Example 4