Vasya and Petya wrote down all integers from 1 to *n* to play the "powers" game (*n* can be quite large; however, Vasya and Petya are not confused by this fact).

Players choose numbers in turn (Vasya chooses first). If some number *x* is chosen at the current turn, it is forbidden to choose *x* or all of its other positive integer powers (that is, *x*<sup class="upper-index">2</sup>, *x*<sup class="upper-index">3</sup>, ...) at the next turns. For instance, if the number 9 is chosen at the first turn, one cannot choose 9 or 81 later, while it is still allowed to choose 3 or 27. The one who cannot make a move loses.

Who wins if both Vasya and Petya play optimally?
Input contains single integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">9</sup>).
import math
val = [
    0, 1, 2, 1, 4, 3, 2, 1, 5, 6, 2, 1, 8, 7, 5, 9, 8, 7, 3, 4, 7, 4, 2, 1,
    10, 9, 3, 6, 11, 12
]
n = int(input())
taken = [False] * 40005
res = 0
rem = n
for i in range(2, int(math.sqrt(n)) + 1):
    if taken[i]:
        continue
    sz = 1
    a = i
    taken[a] = True
    while a * i <= n:
        a *= i
        sz += 1
        if a * a <= n:
            taken[a] = True
    rem -= sz
    res ^= val[sz]
res ^= (rem % 2)
print("Vasya" if res else "Petya")# 1692604895.7939215