#include <bits/stdc++.h>
using namespace std;
const int N = 6e4 + 10;
const 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};
bool was[N];
int main() {
  int n;
  scanf("%d", &n);
  int ans = 0;
  int tot = n;
  for (int u = 2; u * u <= n; ++u) was[u] = 0;
  for (int u = 2; u * u <= n; ++u) {
    if (was[u]) continue;
    was[u] = 1;
    int x = u, y = 1;
    while ((long long)x * u <= n) {
      x *= u;
      if ((long long)x * x <= n) was[x] = 1;
      ++y;
    }
    ans ^= g[y];
    tot -= y;
  }
  if (tot & 1) ans ^= 1;
  puts(ans ? "Vasya" : "Petya");
  return 0;
}
