#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
const int MAXE = 200005;
const long long INF = 1e18;
struct Edge {
  int v, n;
  Edge() {}
  Edge(int v, int n) : v(v), n(n) {}
};
Edge E[MAXE];
int H[MAXN], cntE;
int val[MAXN];
long long dp[MAXN][2];
int n;
long long ans;
void clear() {
  cntE = 0;
  memset(H, -1, sizeof H);
}
void addedge(int u, int v) {
  E[cntE] = Edge(v, H[u]);
  H[u] = cntE++;
}
long long dfs(int u) {
  long long minv = INF;
  long long sum = 0;
  int cnt = 0;
  dp[u][0] = 0;
  dp[u][1] = val[u];
  for (int i = H[u]; ~i; i = E[i].n) {
    int v = E[i].v;
    dfs(v);
    long long tmp = max(dp[v][1], dp[v][0]);
    minv = dp[u][0] += tmp;
    dp[u][1] += tmp;
    minv = min(minv, tmp + val[v]);
    ++cnt;
  }
  if (cnt & 1) sum -= minv;
  ans = max(ans, sum + val[u]);
  return sum;
}
int a, b, c, d;
void solve() {
  if (a + b <= min(c, d) + max(c, d) - min(c, d)) {
    printf("Polycarp\n");
    return;
  }
  if (a > c || b > d)
    printf("Vasiliy\n");
  else
    printf("Polycarp\n");
}
int main() {
  while (~scanf("%d%d%d%d", &a, &b, &c, &d)) solve();
  return 0;
}
