CodeForces

C. Voting

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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
题意：一组字符串中有DR两种字符
按顺序执行一种规则 D可以删除任意位置上的R字符 （R同理） 往复循环
问最后剩下的是什么字符
直接用队列模拟  比较DR位序的大小  

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<string.h>
#include<set>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<cmath>
typedef long long ll;
typedef unsigned long long LL;
using namespace std;
const double PI=acos(-1.0);
const double eps=0.0000000001;
const ll mod=998244353;
const int N=2000000+100;
char str[N];
int sum1[N];
int sum2[N];
int n;
queue<int>R,D;
int main(){
    while(scanf("%d",&n)!=EOF){
        scanf("%s",str+1);
        while(!D.empty())D.pop();
        while(!R.empty())R.pop();
        for(int i=1;i<=n;i++){
            if(str[i]=='D')D.push(i);
            else{
                R.push(i);
            }
        }
        while(D.empty()==0&&R.empty()==0){
            int x=D.front();
            int y=R.front();
            if(x<y){
                R.pop();
                D.pop();
                D.push(x+n);
            }
            else{
                D.pop();
                R.pop();
                R.push(y+n);
            }
        }
        if(D.empty()==0){
            cout<<"D"<<endl;
        }
        else{
            cout<<"R"<<endl;
        }
    }
}