#include <bits/stdc++.h>
using namespace std;
int vis[100000];
int grundy[30] = {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 main() {
  long long n, i, j, temp, rem = 0;
  scanf("%I64d", &n);
  long long maxx = sqrt(n);
  long long ans = 1;
  for (i = 2; i <= maxx; i++) {
    if (vis[i] == 1) continue;
    j = i;
    temp = 0;
    while (j <= n) {
      temp++;
      if (j <= maxx)
        vis[j] = 1;
      else
        rem++;
      j *= i;
    }
    ans ^= grundy[temp];
  }
  temp = n - maxx - rem;
  if (temp & 1) ans ^= 1;
  if (ans == 0)
    printf("Petya\n");
  else
    printf("Vasya\n");
  return 0;
}
