#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main(){

	int pRes, vRes, numOfPiles;

	cin>>numOfPiles>>pRes>>vRes;

	int sum = 0;
	//vector<int> v(numOfPiles);
	int tmp;
	for (int i = 0; i < numOfPiles; i++) {
		//cin >> v[i];
		cin >> tmp;		
		sum += tmp;
	}
	
//	cout << "SUM: " << sum << endl;
	cout << (sum%2!=0? "Petyr" : "Varys");
/*
	bool isPetysTurn = true;
	
	sort(v.begin(), v.end(), greater<int>());

	while (true) {

		int res = isPetysTurn? pRes : vRes;


		if(res >= sum && v[0] == sum){
			cout << (isPetysTurn? "Petyr" : "Varys");
			break;	
		}
		if(v[0] == 1){ v.push_back(1); v.erase(v.begin()); }
		
		if(v[0] == 0) v.erase(v.begin());

		v[0]--;
		sum--;	

		isPetysTurn = !isPetysTurn;
	}
*/
  return 0;
}









/*

  for (int i = 0; i < numOfPiles; i++) {
    cin >> piles[i];
    sum += piles[i];
  }

  bool isPetysTurn = true;

  while (true) {

    int res = isPetysTurn? pRes : vRes;

    //int biggest = 0;

    //for (int i = 0; i < numOfPiles; i++) {
    //    if(piles[biggest] < piles[i]){
     //     biggest = i;
    //    }
    //    sum += piles[i];
    //}

    //if(res < piles[biggest]){
    //  piles[biggest]--;

    //cout << "Sum: " << sum << endl;
    //cout << "Turn: " << (isPetysTurn? "Petyr" : "Varys") << endl;
    //cout << "Biggest: " <<biggest << " = " << piles[biggest] << endl;

    if(res >= sum){ // && piles[biggest] == sum){

      int biggest = 0;

      for (int i = 0; i < numOfPiles; i++) {
          if(piles[biggest] < piles[i]){
            biggest = i;
          }
      }

      if(piles[biggest] == sum){
        cout << (isPetysTurn? "Petyr" : "Varys");
        break;
      }else{
        sum--;
        piles[0]--;
      }

    }else{
      sum--;
      piles[0]--;
    }

    isPetysTurn = !isPetysTurn;
  }
*/