#include <bits/stdc++.h>
using namespace std;
int n, grundy[30] = {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};
bitset<40004> M;
int main() {
  scanf("%d", &n);
  int _n = n, _xor = 0;
  for (int i = 2; i * i <= n; i++)
    if (!M[i]) {
      int cnt = 1;
      M[i] = 1;
      for (int j = i; 1LL * j * i <= n; j *= i) {
        if (j < 40004) M[j] = 1;
        cnt++;
      }
      _n -= cnt;
      _xor ^= grundy[cnt];
    }
  _xor ^= _n & 1;
  return !printf(_xor ? "Vasya" : "Petya");
}
