Taco Game Winner Determination

In this problem, you are given t independent test cases. For each test case, you are given an integer n and an array of n positive integers. The actual values in the array do not affect the outcome of the game. The winner is determined solely based on the parity of n.

If n is odd, then Petya wins; otherwise, if n is even, Vasya wins. Formally, Petya wins if \(n \equiv 1 \pmod{2}\) and Vasya wins if \(n \equiv 0 \pmod{2}\).

Your task is to determine the winner for each test case.

inputFormat

The first line of input contains a single integer t (1 ≤ t ≤ 10⁴), representing the number of test cases. The description of the test cases follows.

For each test case:

• The first line contains an integer n (1 ≤ n ≤ 10⁵), the number of elements in the array.
• The next line contains n space-separated positive integers.

Note: The integers in the array do not influence the result.

outputFormat

For each test case, print a single line containing the name of the winner: either "Petya" if Petya wins the game, or "Vasya" if Vasya wins the game.

## sample

2
3
6 9 12
4
2 3 5 7

Petya
Vasya

</p>