#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long int LINF = (long long int)1e18;
long long int gcd(long long int a, long long int b) {
  long long int r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long int lcm(long long int a, long long int b) {
  return a / gcd(a, b) * b;
}
long long int fpow(long long int n, long long int k, int p = MOD) {
  long long int r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
void addmod(long long int& a, long long int val, long long int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
void submod(long long int& a, long long int val, long long int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
int mult(long long int a, long long int b, long long int p = MOD) {
  return (long long int)a * b % p;
}
int inv(long long int a, long long int p = MOD) { return fpow(a, p - 2, p); }
int w[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},
    P = 1, L, c;
bool v[100001];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, j;
  cin >> n;
  L = n - 1;
  for (int i = 2; i * i <= n; i++) {
    if (v[i]) continue;
    j = i;
    c = 0;
    while (1) {
      L--;
      c++;
      if (j <= n / j) v[j] = true;
      if (j > n / i) break;
      j *= i;
    }
    P ^= w[c];
  }
  P ^= (L & 1);
  cout << (P ? "Vasya" : "Petya");
  return 0;
}
