#include <bits/stdc++.h>
using namespace std;
int n;
int SG[50] = {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};
map<long long, int> vis;
int main() {
  while (cin >> n) {
    long long ans = 0;
    long long tot = 0;
    for (long long i = 2; i * i <= n; ++i) {
      if (!vis[i]) {
        int cnt = 0;
        for (long long j = i; j <= n; j *= i) {
          if (j < 100000) {
            vis[j] = 1;
          }
          cnt++;
          tot++;
        }
        ans ^= SG[cnt];
      }
    }
    ans ^= ((n - tot) & 1);
    if (ans == 0)
      cout << "Petya" << endl;
    else
      cout << "Vasya" << endl;
  }
  return 0;
}
