#include <bits/stdc++.h>
using namespace std;
const int inf = ~0U >> 1;
const long long INF = ~0ULL >> 1;
int xp, yp, xv, yv;
int solve() {
  while (true) {
    if (xp == 0 && yp == 0) return 1;
    if (xp == 0)
      yp--;
    else if (yp == 0)
      xp--;
    else {
      if (xp - yp > xv - yv)
        xp--;
      else
        yp--;
    }
    if (xp == 0 && yp == 0) return 1;
    if (xv == 0 && yv == 0) return 0;
    if (xv == 0)
      yv--;
    else if (yv == 0)
      xv--;
    else {
      if (xv - 1 != xp || yv - 1 != yp)
        xv--, yv--;
      else
        --xv;
    }
    if (xv == 0 && yv == 0) return 0;
  }
}
int main() {
  scanf("%d%d%d%d", &xp, &yp, &xv, &yv);
  puts(solve() ? "Polycarp" : "Vasiliy");
  return 0;
}
