#include <bits/stdc++.h>
using namespace std;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
const int N = 1e5;
const int L = 30;
const int MOD = 1e9 + 7;
const long double eps = 1e-12;
int n;
int g[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};
set<int> st;
int main() {
  n = in();
  int ans = g[1], cnt = 0;
  for (int i = 2; i <= min(n, N); i++) {
    if (st.find(i) != st.end()) continue;
    st.insert(i);
    int sum = 0;
    for (long long j = i; j <= n; j *= i) {
      if (j > N) cnt++;
      sum++;
      st.insert(j);
    }
    ans ^= g[sum];
  }
  if (n > N && (n - N - cnt) % 2) ans ^= 1;
  if (!ans)
    cout << "Petya";
  else
    cout << "Vasya";
  return 0;
}
