#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};
bool vis[100005];
int main() {
  long long n, ans = 0;
  int sum = 0;
  scanf("%lld", &n);
  for (long long i = 2LL; i * i <= n; i++) {
    if (vis[i]) continue;
    int cnt = 0;
    long long j = i;
    while (j <= n) {
      cnt++;
      if (j < 100005) vis[j] = 1;
      sum++;
      j *= i;
    }
    ans ^= sg[cnt];
  }
  ans ^= (n - sum) & 1;
  if (!ans)
    printf("Petya");
  else
    printf("Vasya");
  return 0;
}
