#include <bits/stdc++.h>
using namespace std;
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};
int main() {
  int n;
  scanf("%d", &n);
  int ones = n;
  bool vis[100100] = {false};
  vector<int> v;
  for (long long i = 2; i * i <= n; i++) {
    if (vis[i]) continue;
    int size = 0;
    for (long long j = i; j <= n; j = j * i) {
      if (j * j <= n) vis[j] = true;
      size++;
      ones--;
    }
    v.push_back(grundy[size]);
  }
  ones %= 2;
  for (int i = 0; i < (int)v.size(); i++) ones = ones ^ v[i];
  if (ones)
    cout << "Vasya" << endl;
  else
    cout << "Petya" << endl;
  return 0;
}
