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.

 1 #include<cstdio>
 2 #include<string>
 3 #include<cstring>
 4 #include<iostream>
 5 #include<algorithm>
 6 using namespace std;
 7 typedef long long ll;
 8
 9 const int INF=100000;
10
11 int main()
12 {   int n;
13     cin>>n;
14     char a[1005];
15     scanf("%s",a);
16     int len=strlen(a),rp=INF,rq=-1,lp=INF,lq=-1;
17     for(int i=0;i<len;i++){
18         if(a[i]=='R') { rp=min(rp,i); rq=max(rq,i); }
19         if(a[i]=='L') { lp=min(lp,i); lq=max(lq,i); }
20     }
21     bool rf=false,lf=false;
22     if(rp==INF&&rq==-1) rf=true;
23     if(lp==INF&&lq==-1) lf=true;
24     if(rf) cout<<lq+1<<" "<<lp<<endl;
25     if(lf) cout<<rp+1<<" "<<rq+2<<endl;
26     if(!rf&&!lf) cout<<rp+1<<" "<<lp<<endl;
27 }

转载于:https://www.cnblogs.com/zgglj-com/p/7257982.html

Snow Footprints CodeForces - 298A相关推荐

CodeForces 298A　Snow Footprints
1.http://codeforces.com/problemset/problem/298/A 2.题目大意:给定一个小球,可以往左往右移动,如果小球从第i个位置移到第i+1个位置,那么第i个位置将 ...
Codeforces Round #180 (Div. 2) A. Snow Footprints 贪心
A. Snow Footprints 题目连接: http://www.codeforces.com/contest/298/problem/A Description There is a stra ...
文章标题 CoderForces 298A： Snow Footprints（水）
Snow Footprints Description There is a straight snowy road, divided into n blocks. The blocks are nu ...
Codeforces 298A Snow Footprints 题解
题意雪地里有一条路,可以向左走.向右走,每走一步会在这一步的起点留下一个朝向走的方向的脚印,新脚印会覆盖旧脚印,现给出脚印的情况,判断起点和终点思路如果只有一个方向的脚印,那就是从脚印的一头走到 ...
298A Snow Footprints
http://codeforces.com/problemset/problem/298/A 归纳题,若是存在R或者L,则必定左边为R,右边卫L,开始地点随意定在存在L或者R的位置,结束地点定在L和R ...
Snow Footprints
There is a straight snowy road, divided into n blocks. The blocks are numbered from 1 to n from left ...
【Codeforces】A2组刷题记录（50 / 50）完结
目录 A1. Counterexample A2. Good Number A3. Dice Tower ★A4. Alyona and Numbers A5. Mountain Scenery rz ...
【二分】Producing Snow @Codeforces Round #470 Div.2 C
time limit per test: 1 second memory limit per test: 256 megabytes Alice likes snow a lot! Unfortuna ...
Codeforces Round #470 (rated, Div. 2 C. Producing Snow(思维）
C. Producing Snow time limit per test 1 second memory limit per test 256 megabytes input standard in ...

Snow Footprints CodeForces - 298A

Snow Footprints CodeForces - 298A相关推荐

最新文章

热门文章