Problem: One fine October day a mathematics teacher Vasily Petrov went to a class and saw there n pupils who sat at the <image> desks, two people at each desk. Vasily quickly realized that number n is even. Like all true mathematicians, Vasily has all students numbered from 1 to n.

But Vasily Petrov did not like the way the children were seated at the desks. According to him, the students whose numbers differ by 1, can not sit together, as they talk to each other all the time, distract others and misbehave.

On the other hand, if a righthanded student sits at the left end of the desk and a lefthanded student sits at the right end of the desk, they hit elbows all the time and distract each other. In other cases, the students who sit at the same desk, do not interfere with each other.

Vasily knows very well which students are lefthanders and which ones are righthanders, and he asks you to come up with any order that meets these two uncomplicated conditions (students do not talk to each other and do not bump their elbows). It is guaranteed that the input is such that at least one way to seat the students always exists.

Input

The first input line contains a single even integer n (4 ≤ n ≤ 100) — the number of students in the class. The second line contains exactly n capital English letters "L" and "R". If the i-th letter at the second line equals "L", then the student number i is a lefthander, otherwise he is a righthander.

Output

Print <image> integer pairs, one pair per line. In the i-th line print the numbers of students that will sit at the i-th desk. The first number in the pair stands for the student who is sitting to the left, and the second number stands for the student who is sitting to the right. Separate the numbers in the pairs by spaces. If there are multiple solutions, print any of them.

Examples

Input

6
LLRLLL


Output

1 4
2 5
6 3


Input

4
RRLL


Output

3 1
4 2

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;

public class A {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(
				new FileInputStream("input.txt")));
		OutputStreamWriter out = new OutputStreamWriter(new FileOutputStream(
				"output.txt"));

		int N = Integer.parseInt(br.readLine());
		char[] students = br.readLine().trim().toCharArray();
		boolean[] done = new boolean[students.length];

		for (int i = 0; i < students.length; i++) {
			String[] ans = dfs(i, students, done, new String[N / 2], 0);
			if (ans!=null) {
				for (int zz = 0; zz < ans.length; zz++) {
					System.out.println(ans[zz]);
					out.write(ans[zz] + System.lineSeparator());
				}
				break;
			}
		}
		out.close();
	}

	private static String[] dfs(int pick, char[] students, boolean[] done,
			String[] sol, int size) {
		if (sol[sol.length - 1] != null) {
			return sol;
		}
		// Find Pair
		done[pick] = true;
		for (int i = 0; i < done.length; i++) {
			if (done[i] == true || i == pick || i == pick + 1 || i == pick - 1)
				continue;
			done[i] = true;
			if (students[pick] == 'L')
				sol[size] = (pick + 1) + " " + (i + 1);
			else
				sol[size] = (i + 1) + " " + (pick + 1);
			String[] ans = dfs(firstNotYetDone(done), students, done, sol,
					size + 1);
			if (ans != null)
				return ans;
			sol[size] = "";
			done[i] = false;
		}
		done[pick] = false;
		return null;
	}

	private static int firstNotYetDone(boolean[] done) {
		for (int i = 0; i < done.length; i++) {
			if (!done[i])
				return i;
		}
		return -1;
	}
}