#include <bits/stdc++.h>
using namespace std;
long long SG[1110000] = {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, 13};
long long n, Ans, vis[1110000];
set<long long> Hehe;
int main() {
  scanf("%I64d", &n);
  long long Orz = (long long)(floor)(sqrt(1.0 * n));
  for (long long i = 2; i * i <= n; ++i) {
    long long c = 0;
    if (vis[i]) continue;
    for (long long j = i; j <= n; j *= i, c++) {
      if (j > Orz)
        Hehe.insert(j);
      else
        vis[j] = 1;
    }
    Ans ^= SG[c];
  }
  long long tmp = n - Orz - Hehe.size();
  if (!(tmp & 1)) Ans ^= 1;
  if (Ans)
    printf("Vasya");
  else
    printf("Petya");
  return 0;
}
