Robby is a path-finding robot and is very good at its job! Given a series of instructions of a path to follow (as how far forward to move based on current orientation or an instruction to turn left or right), Robby always follows these instructions perfectly.
Unfortunately, Robby's instruction following module is currently malfunctioning, so it'll need a software patch to figure out how to follow instructions once again. Can you write a program that given a series instructions figures out where Robby should end up?
Robby will initially start off facing north from the x, y position (0, 0). Robby can be given three types of instructions. First, if Robby is given the instruction _F_ $i$ for some integer $i$, Robby will move forward $i$ spaces based on the direction it is currently facing. Next, if Robby is given the instruction _L_, Robby will turn 90 degrees to the left. Finally, if Robby is given the instruction _R_, Robby will turn 90 degrees to the right. Process all of the instructions given to Robby and output the final x, y position that Robby ends in.
The first line of the input will consist of a single integer $n$ ($1 <= n <= 1000$) giving the number of instructions that Robby must follow. The next $n$ lines consist of instructions as described above. If the instruction begins with an _F_, it will also contain a single integer $i$ ($1 <= i <= 100$) giving the distances Robby should travel forward. Otherwise the instruction will only consist of a single character _L_ or _R_, indicating Robby should turn 90 degrees to the left or right, respectively.
Print two space separated integers, x and y, giving the final x, y position that Robby ends in.
## Input
The first line of the input will consist of a single integer $n$ ($1 <= n <= 1000$) giving the number of instructions that Robby must follow. The next $n$ lines consist of instructions as described above. If the instruction begins with an _F_, it will also contain a single integer $i$ ($1 <= i <= 100$) giving the distances Robby should travel forward. Otherwise the instruction will only consist of a single character _L_ or _R_, indicating Robby should turn 90 degrees to the left or right, respectively.
## Output
Print two space separated integers, x and y, giving the final x, y position that Robby ends in.
[samples]
**Definitions**
Let $ n \in \mathbb{Z} $ be the number of instructions.
Let $ P = (x, y) \in \mathbb{Z}^2 $ denote Robby’s position, initialized to $ (0, 0) $.
Let $ d \in \{0, 1, 2, 3\} $ denote Robby’s direction, where:
- $ 0 $: north ($ \uparrow $),
- $ 1 $: east ($ \rightarrow $),
- $ 2 $: south ($ \downarrow $),
- $ 3 $: west ($ \leftarrow $).
Initialized to $ d = 0 $.
Let $ I = (i_1, i_2, \dots, i_n) $ be a sequence of instructions, where each $ i_k $ is:
- $ \texttt{F } s $ for some $ s \in \mathbb{Z} $, $ 1 \le s \le 100 $, meaning move forward $ s $ units in current direction, or
- $ \texttt{L} $, meaning turn left ($ d \leftarrow (d - 1) \mod 4 $), or
- $ \texttt{R} $, meaning turn right ($ d \leftarrow (d + 1) \mod 4 $).
**Constraints**
1. $ 1 \le n \le 1000 $
2. For each forward instruction $ \texttt{F } s $, $ 1 \le s \le 100 $
**Objective**
Compute the final position $ (x, y) $ after processing all instructions $ I $, where movement in direction $ d $ updates position as:
- $ d = 0 $: $ (x, y) \leftarrow (x, y + s) $
- $ d = 1 $: $ (x, y) \leftarrow (x + s, y) $
- $ d = 2 $: $ (x, y) \leftarrow (x, y - s) $
- $ d = 3 $: $ (x, y) \leftarrow (x - s, y) $
Output $ (x, y) $.