#include <bits/stdc++.h>
using namespace std;
int cnt[101000];
int all = 0;
int g[100]{
    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,
};
int mark[110];
int main() {
  long long n;
  cin >> n;
  long long sum = 0;
  for (long long i = 1; i * i <= n; i++) {
    if (cnt[i] == -1) continue;
    cnt[i] = 1;
    all++;
    long long j = i * i;
    if (i == 1) {
      sum ^= g[cnt[i]];
      continue;
    }
    while (j <= n) {
      cnt[i]++;
      all++;
      if (j <= 100000) cnt[j] = -1;
      j = j * i;
    }
    sum ^= g[cnt[i]];
  }
  sum ^= (n - all) % 2;
  if (sum) {
    printf("Vasya\n");
  } else
    printf("Petya\n");
  return 0;
}
