You are trapped in Jabba's Palace. You hold a coded map that describes the way out from your current location. The map is a sequence of positive integers, and each integer encodes one of three directions (left, straight, or right).
To decode an integer, convert it to binary (base two, with no leading zeros) and compare how many 0s and 1s it contains:
Read the whole sequence and print the direction for each integer, in order, to find your way out.
The table below shows three examples of converting a positive (decimal) integer to binary and then to a direction.
| Decimal | Binary | Direction |
|---|---|---|
17 | 10001 | left |
9 | 1001 | straight |
22 | 10110 | right |
A sequence of positive integers, one per line, until the end of input.
For each integer, print its direction (left, straight, or right) on its own line, in the same order as the input. Do not print any extra blank lines.