#385. PingPong: 1 to n
You get n. For each number from 1 to n: if it can be divided by both 2 and 7, print `PingPong`; if only by 2, print `Ping`; if only by 7, print `Pong`; otherwise print the number.
### Input
One integer n (1 ≤ n ≤ 100).
### Output
n lines.
Examples
Input
58
Output
1 Ping 3 Ping 5 Ping Pong Ping 9 Ping 11 Ping 13 PingPong 15 Ping 17 Ping 19 Ping Pong Ping 23 Ping 25 Ping 27 PingPong 29 Ping 31 Ping 33 Ping Pong Ping 37 Ping 39 Ping 41 PingPong 43 Ping 45 Ping 47 Ping Pong Ping 51 Ping 53 Ping 55 PingPong 57 Ping
Input
92
Output
1 Ping 3 Ping 5 Ping Pong Ping 9 Ping 11 Ping 13 PingPong 15 Ping 17 Ping 19 Ping Pong Ping 23 Ping 25 Ping 27 PingPong 29 Ping 31 Ping 33 Ping Pong Ping 37 Ping 39 Ping 41 PingPong 43 Ping 45 Ping 47 Ping Pong Ping 51 Ping 53 Ping 55 PingPong 57 Ping 59 Ping 61 Ping Pong Ping 65 Ping 67 Ping 69 PingPong 71 Ping 73 Ping 75 Ping Pong Ping 79 Ping 81 Ping 83 PingPong 85 Ping 87 Ping 89 Ping Pong Ping
💡 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.