#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000;
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};
bool vis[maxn];
set<int> S;
int n, num, res, cnt;
int main() {
  scanf("%d", &n);
  cnt = n;
  for (int i = 2; i * i <= n; i++)
    if (!vis[i]) {
      num = 0;
      for (long long j = i; j <= n; j *= i) {
        num++;
        cnt--;
        if (j * j <= n) vis[j] = 1;
      }
      res ^= SG[num];
    }
  puts(res ^ (cnt & 1) ? "Vasya" : "Petya");
  return 0;
}
