Snow Footprints CodeForces

There is a straight snowy road, divided into n blocks. The blocks are numbered from 1 to n from left to right. If one moves from the i-th block to the (i + 1)-th block, he will leave a right footprint on the i-th block. Similarly, if one moves from the i-th block to the (i - 1)-th block, he will leave a left footprint on the i-th block. If there already is a footprint on the i-th block, the new footprint will cover the old one.

At the beginning, there were no footprints. Then polar bear Alice starts from the s-th block, makes a sequence of moves and ends in the t-th block. It is known that Alice never moves outside of the road.

You are given the description of Alice's footprints. Your task is to find a pair of possible values of s, t by looking at the footprints.

Input

The first line of the input contains integer n (3 ≤ n ≤ 1000).

The second line contains the description of the road — the string that consists of n characters. Each character will be either "." (a block without footprint), or "L" (a block with a left footprint), "R" (a block with a right footprint).

It's guaranteed that the given string contains at least one character not equal to ".". Also, the first and the last character will always be ".". It's guaranteed that a solution exists.

Output

Print two space-separated integers — the values of s and t. If there are several possible solutions you can print any of them.

Example

Input

9
..RRLL...

Output

3 4

Input

11
.RRRLLLLL..

Output

7 5

Note

The first test sample is the one in the picture.

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;

const int INF=100000;

int main()
{   int n;
    cin>>n;
    char a[1005];
    scanf("%s",a);
    int len=strlen(a),rp=INF,rq=-1,lp=INF,lq=-1;
    for(int i=0;i<len;i++){
        if(a[i]=='R') { rp=min(rp,i); rq=max(rq,i); }
        if(a[i]=='L') { lp=min(lp,i); lq=max(lq,i); }
    }
    bool rf=false,lf=false;
    if(rp==INF&&rq==-1) rf=true;
    if(lp==INF&&lq==-1) lf=true;
    if(rf) cout<<lq+1<<" "<<lp<<endl;
    if(lf) cout<<rp+1<<" "<<rq+2<<endl;
    if(!rf&&!lf) cout<<rp+1<<" "<<lp<<endl;    
}