#include <bits/stdc++.h>
using namespace std;
const int f[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 count(int n, int p) {
  int m = pow(n, 1.0 / (double)p);
  return m;
  long long t = m + 1;
  long long s = 1;
  for (int i = 1; i <= p; i++) s *= t;
  if (s <= n) return m + 1;
  s = 1;
  t = m;
  for (int i = 1; i <= p; i++) s *= t;
  if (s > n) return m - 1;
  return m;
}
int count(int n) {
  int m = count(n, 2) + count(n, 3) + count(n, 5) + count(n, 7) + count(n, 11) +
          count(n, 13) + count(n, 17) + count(n, 19) + count(n, 23) +
          count(n, 29) - count(n, 6) - count(n, 10) - count(n, 14) -
          count(n, 22) - count(n, 26) - count(n, 15) - count(n, 21);
  return n - m;
}
int maxx[31], c[31];
int main() {
  int n, fff = 1;
  cin >> n;
  maxx[1] = n;
  c[1] = count(n);
  for (int i = 2; i <= 30; i++) {
    maxx[i] = count(n, i);
    c[i] = count(maxx[i]);
  }
  for (int i = 1; i <= 29; i++)
    if (maxx[i + 1] < maxx[i] && (c[i] - c[i + 1]) % 2 == 1) fff = fff ^ f[i];
  if (fff > 0)
    cout << "Vasya";
  else
    cout << "Petya";
}
