#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  long long r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const int maxn = 100010;
int xp, yp;
int xv, yv;
void solve() {
  scanf("%d%d%d%d", &xp, &yp, &xv, &yv);
  if (xp + yp <= max(xv, yv) || (xp <= xv && yp <= yv))
    printf("Polycarp");
  else
    printf("Vasiliy");
}
int main() {
  solve();
  return 0;
}
