Jane's family has just moved to a new city and today is her first day of school. She has a list of instructions for walking from her home to the school. Each instruction describes a turn she must make. For example, the list

```
R
QUEEN
R
FOURTH
R
SCHOOL
```

means that she must turn right onto Queen Street, then turn right onto Fourth Street, then finally turn right into the school. Your task is to write a computer program which will create instructions for walking in the opposite direction: from her school to her home.

The input and output for your program will be formatted like the samples below. You may assume that Jane's list contains at least two but at most five instructions, and you may assume that each line contains at most 10 characters, all of them capital letters. The last instruction will always be a turn into the "`SCHOOL`

".

#### Sample Input 1

```
R
QUEEN
R
FOURTH
R
SCHOOL
```

#### Sample Output 1

```
Turn LEFT onto FOURTH street.
Turn LEFT onto QUEEN street.
Turn LEFT into your HOME.
```

#### Sample Input 2

```
L
MAIN
R
SCHOOL
```

#### Sample Output 2

```
Turn LEFT onto MAIN street.
Turn RIGHT into your HOME.
```

CCC problem statements in large part from the PEG OJ

## Comments

Does anyone know why I am getting

`WA`

on`Testcases 2 & 3`

?Thanks.

Shouldn't

`Sample Input 2`

be:Since R = L and L = R?

EDIT: I realized my mistake.

Nope, if you draw the diagram out, you see that the sample is indeed correct, do you really think that 532 users have passed this question with a wrong code????

No, sorry, I now realize that the

`Sample`

is correct.Dont you need to tell us how many turns will be made at the very beginning?

It will always end with SCHOOL.