#include <bits/stdc++.h>
using namespace std;
bool flag[1000010];
int n;
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};
int main() {
  scanf("%d", &n);
  int sum = n;
  int ans = 0;
  for (long long i = 2; i * i <= n; i++) {
    if (flag[i]) continue;
    int tmp = 0;
    for (long long x = i; x <= n; x *= i) {
      if (x * x <= n) flag[x] = 1;
      tmp++;
    }
    ans ^= SG[tmp];
    sum -= tmp;
  }
  ans ^= sum & 1;
  if (ans == 0)
    puts("Petya");
  else
    puts("Vasya");
  return 0;
}
