#include <bits/stdc++.h>
using namespace std;
int grundy[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};
int freq[64];
int mark[31622 + 40];
int main() {
  int N;
  cin >> N;
  int pile1 = N;
  mark[1] = 1;
  for (int i = 2; i * i <= N; ++i) {
    if (mark[i] == 0) {
      int P = 0;
      for (signed long long int j = i; j <= N; j *= i) {
        if (j <= 31622 + 1) mark[j] = 1;
        --pile1;
        P++;
      }
      freq[P]++;
    }
  }
  int ans = 0;
  freq[1] = pile1;
  for (int i = 1; i <= 30; ++i) {
    if (freq[i] % 2 == 1) {
      ans ^= grundy[i];
    }
  }
  if (ans > 0) {
    cout << "Vasya";
  } else {
    cout << "Petya";
  }
}
