#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T x) {
  return x > 0 ? x : -x;
}
const int N = 1e5;
int n;
bool used[N + 5];
int main() {
  const int grundy[] = {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, 1};
  scanf("%d", &n);
  memset((used), (0), sizeof(used));
  int cnt = n, ans = 0;
  for (int i = 2; i * 1ll * i <= n; ++i) {
    if (used[i]) continue;
    int x = 0;
    for (long long j = i; j <= n; j *= i) {
      if (j < N) used[j] = 1;
      ++x;
    }
    cnt -= x;
    ans ^= grundy[x];
  }
  ans ^= cnt & 1;
  printf("%s\n", ans ? "Vasya" : "Petya");
  return 0;
}
