#include <bits/stdc++.h>
using namespace std;
int INP, AM, REACHEOF;
char BUF[(1 << 12) + 1], *inp = BUF;
int grundy[31] = {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, 14};
bool mark[100111];
int main() {
  int n;
  while (cin >> n) {
    int ln = 1;
    while (ln * ln <= n) ++ln;
    --ln;
    int rev = n - ln;
    memset(mark, false, sizeof mark);
    int sum = 0;
    for (int i = (1), _b = (ln); i <= _b; i++)
      if (!mark[i]) {
        if (i == 1) {
          sum ^= grundy[1];
          continue;
        }
        int t = 1;
        long long p = i;
        while (p * i <= n) {
          p *= i;
          if (p > ln)
            --rev;
          else
            mark[p] = true;
          ++t;
        }
        sum ^= grundy[t];
      }
    rev %= 2;
    if (sum ^ rev)
      puts("Vasya");
    else
      puts("Petya");
  }
  return 0;
}
