#include <bits/stdc++.h>
using namespace std;
int nim[31] = {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};
int cnt[31];
bool used[(int)1e5];
int main() {
  int n;
  scanf("%d", &n);
  int sum = 0;
  for (int i = 2; i * i <= n; i++) {
    if (!used[i]) {
      int num = 0;
      long long pos = i;
      while (pos <= n) {
        if (pos * pos <= n) {
          used[pos] = true;
        }
        num++;
        pos *= i;
        sum++;
      }
      cnt[num]++;
    }
  }
  cnt[1] = n - sum;
  int ans = 0;
  for (int i = 1; i <= 30; i++) {
    if (cnt[i] % 2 == 1) {
      ans ^= nim[i];
    }
  }
  if (ans == 0) {
    printf("Petya");
  } else {
    printf("Vasya");
  }
  return 0;
}
