#338. PinPong: 1 to n
You get n. For each number from 1 to n: if it can be divided by both 2 and 3, print `PinPong`; if only by 2, print `Pin`; if only by 3, print `Pong`; otherwise print the number.
### Input
One integer n (1 ≤ n ≤ 100).
### Output
n lines.
Examples
Input
59
Output
1 Pin Pong Pin 5 PinPong 7 Pin Pong Pin 11 PinPong 13 Pin Pong Pin 17 PinPong 19 Pin Pong Pin 23 PinPong 25 Pin Pong Pin 29 PinPong 31 Pin Pong Pin 35 PinPong 37 Pin Pong Pin 41 PinPong 43 Pin Pong Pin 47 PinPong 49 Pin Pong Pin 53 PinPong 55 Pin Pong Pin 59
Input
2
Output
1 Pin
💡 You can solve it with Python, JavaScript or blocks. Read the input line by line with input(). Don't print a question (like input("Number: ")). Print exactly what the output asks for, nothing more.