#include <bits/stdc++.h>
using namespace std;
const int sg[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 i, j, k, n, m, a[40], ff[100000], an;
int main() {
  scanf("%d", &n);
  m = int(sqrt(n));
  a[1] = n - m + 1;
  for (i = 2; i <= m; i++)
    if (!ff[i]) {
      for (j = i, k = 1;; j *= i, k++) {
        j <= m ? ff[j] = 1 : a[1]--;
        if (j > n / (0. + i)) break;
      }
      a[k]++;
    }
  for (i = 1; i <= 30; i++) an ^= sg[i] * (a[i] & 1);
  printf("%s", an ? "Vasya" : "Petya");
  return 0;
}
