A survey rover sits at the origin (0, 0) of an infinite integer grid and executes a string of single-step moves. Each character is one of:
Nincreases the y-coordinate by 1,Sdecreases the y-coordinate by 1,Eincreases the x-coordinate by 1,Wdecreases the x-coordinate by 1.
After executing every move in order, report where the rover ends up.
Input format
A single line: a non-empty string of characters, each one of N, S, E, W.
Output format
A single line with two integers x y: the rover's final coordinates.
Constraints
- 1 <= length of the move string <= 100000