#include <bits/stdc++.h>
using namespace std;
const int sg[] = {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};
bitset<1000000007> vis;
set<int> s;
int main() {
  int n;
  cin >> n;
  int ns = sqrt(n);
  int result = 0;
  for (int i = 2; i <= ns + 1; i++) {
    if (!vis[i]) {
      int num = 0;
      for (long long j = i; j <= n; j *= i) {
        num++;
        vis[j] = 1;
        s.insert(j);
      }
      result ^= sg[num];
    }
  }
  result ^= ((n - s.size()) & 1);
  if (result != 0) {
    cout << "Vasya" << endl;
  } else {
    cout << "Petya" << endl;
  }
  return 0;
}
