Codeforces Round #180 (Div. 2) A. Snow Footprints 【思维+模拟】

A. Snow Footprints

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

input

9
..RRLL...

output

3 4

input

11
.RRRLLLLL..

output

7 5

Note

The first test sample is the one in the picture.

原题链接：http://codeforces.com/problemset/problem/298/A

题意：根据给的雪中行走的脚印，推测起点和终点。（后面的脚印会覆盖前面的，有多种答案，正确即可）。

这道题有点意思，但是也要注意细节。

1.全为‘ R ’或全为‘ L ’，（当然可能还谁有‘ . ’）,此时只用考虑一种情况，从一端走到另外一端就可以了；

2。有‘R’和‘L’。此时要注意一个细节，走过才能确定脚印的方向。就是说，现在我在5这个位置，如果之前才有来过，那不能确定，如果之前来过，那就还是之前的脚印。

对于求解得方式有多种：我的方式就是从最后一个向左的脚印的地方开始到最后一个向右的位置+1，这种思路受到样例的干扰，其实还有更简单的方法，就是从左往右模拟，方案就是从第一个向右的地方走到第一个向走的右边。

附上两组测试数据：

Input
17
.......RRRRR.....
Output
8 13
Answer
12 13
Checker Log
ok ok


Input
13
....LLLLLL...
Output
10 4
Answer
10 4
Checker Log
ok ok

AC代码：

/** 
* 行有余力，则来刷题！ 
  * 博客链接:http://blog.csdn.net/hurmishine 
  * 
*/  
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e3+5;
char a[maxn];
int main()
{
    int n;
    while(cin>>n)
    {
        cin>>a;
        int r=-1,l=-1;
        int fr=-1,fl=-1;
        for(int i=0; i<n; i++)
        {
            if(a[i]=='L')
            {
                l=i;
                if(fl==-1) fl=i;
            }
            else if(a[i]=='R')
            {
                r=i;
                if(fr==-1) fr=i;
            }
        }
        if(r==-1)
            cout<<l+1<<" "<<fl<<endl;
        else if(l==-1)
            cout<<fr+1<<" "<<r+2<<endl;
        else
            cout<<l+1<<" "<<r+2<<endl;
    }
    return 0;
}