CodeForces - 749C Voting

There are n employees in Alternative Cake Manufacturing (ACM). They are now voting on some very important question and the leading world media are trying to predict the outcome of the vote.

Each of the employees belongs to one of two fractions: depublicans or remocrats, and these two fractions have opposite opinions on what should be the outcome of the vote. The voting procedure is rather complicated:

1. Each of n employees makes a statement. They make statements one by one starting from employees 1 and finishing with employee n. If at the moment when it's time for the i-th employee to make a statement he no longer has the right to vote, he just skips his turn (and no longer takes part in this voting).
2. When employee makes a statement, he can do nothing or declare that one of the other employees no longer has a right to vote. It's allowed to deny from voting people who already made the statement or people who are only waiting to do so. If someone is denied from voting he no longer participates in the voting till the very end.
3. When all employees are done with their statements, the procedure repeats: again, each employees starting from 1 and finishing with n who are still eligible to vote make their statements.
4. The process repeats until there is only one employee eligible to vote remaining and he determines the outcome of the whole voting. Of course, he votes for the decision suitable for his fraction.

You know the order employees are going to vote and that they behave optimal (and they also know the order and who belongs to which fraction). Predict the outcome of the vote.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of employees.

The next line contains n characters. The i-th character is 'D' if the i-th employee is from depublicans fraction or 'R' if he is from remocrats.

Output

Print 'D' if the outcome of the vote will be suitable for depublicans and 'R' if remocrats will win.

Examples

Input

5
DDRRR

Output

D

Input

6
DDRRRR

Output

R

Note

Consider one of the voting scenarios for the first sample:

1. Employee 1 denies employee 5 to vote.
2. Employee 2 denies employee 3 to vote.
3. Employee 3 has no right to vote and skips his turn (he was denied by employee 2).
4. Employee 4 denies employee 2 to vote.
5. Employee 5 has no right to vote and skips his turn (he was denied by employee 1).
6. Employee 1 denies employee 4.
7. Only employee 1 now has the right to vote so the voting ends with the victory of depublicans.

题意：有一个公司有2个不同派别的人，然后每次到一个人发言，那个发言的人就可以让一个人退出，求最后剩下的人是哪个派别的。

题解：用队列做，两个队列分别代表两个派别的人的发言顺序，每次两个派别的人都要出队，同时，排在前面的人可以再次+n后入队，表示从头开始了。直到最后剩下的不为空的队列即为结果。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

const int maxn = 2 * 1e5 + 5;

int main()
{
    queue<int> d;
    queue<int> r;
    char str[maxn];
    int n;
    while(scanf("%d",&n) != EOF)
    {
        while(!d.empty()) d.pop();
        while(!r.empty()) r.pop();
        scanf("%s",str);
        for(int i = 0;i < n;i++)
        {
            if(str[i] == 'D')
            {
                d.push(i + 1);
            }
            else
            {
                r.push(i + 1);
            }
        }
        while(!d.empty() && !r.empty())
        {
            int x = d.front();
            int y = r.front();
            d.pop();
            r.pop();
            if(x < y)
                d.push(x + n);
            else
                r.push(y + n);
        }
        if(d.empty())
        {
            printf("R\n");
        }
        else
        {
            printf("D\n");
        }
    }
    return 0;
}