ABC Legacy#13029

ABC Legacy

1 second
256 megabytes
Hard

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.

Input

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.

Output

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).

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading

Example 3

Loading
Loading

Example 4

Loading
Loading