#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
int sg[] = {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};
const int maxn = 1e6 + 7;
int vis[maxn];
int n;
int main() {
  cin >> n;
  int N = sqrt(n) + 1;
  int ans = 0;
  int t = n;
  for (int i = 2; i < N; i++) {
    if (vis[i]) continue;
    int cnt = 0;
    for (long long j = i; j < N; j *= i) {
      vis[j] = 1;
    }
    for (long long j = i; j <= t; j *= i) {
      cnt++;
    }
    n -= cnt;
    ans ^= sg[cnt];
  }
  if (n & 1) ans ^= 1;
  cout << (ans ? "Vasya" : "Petya") << endl;
  return 0;
}
