#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int p[44] = {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 n;
int mark[N];
int main() {
  cin >> n;
  int ans = 1;
  int jvb = 0;
  if (n > N - 5) {
    jvb = n - N + 5;
  }
  for (int i = 2; i <= min(n, N - 5); i++) {
    int tmp = 0;
    if (!mark[i]) {
      tmp++;
      long long j = (long long)i * i;
      for (; j <= n; j *= i) {
        if (j <= N - 5) {
          mark[j] = true;
        } else {
          jvb--;
        }
        tmp++;
      }
    } else {
      continue;
    }
    ans ^= p[tmp - 1];
  }
  if (jvb % 2 == 1) {
    ans ^= 1;
  }
  if (ans == 0) {
    cout << "Petya" << '\n';
  } else {
    cout << "Vasya" << '\n';
  }
}
