2
1 31
 2
1 0
 10
450661 128600 993228 725823 293549 33490 843121 903634 556169 448234
 1
1
 5
1 3 5 7 9
 6
524 529 5249 524 529 529
 3
1 2 3
 2
0 1
 55
0 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 2 3 4 5 6 7 8 9 3 4 5 6 7 8 9 4 5 6 7 8 9 5 6 7 8 9 6 7 8 9 7 8 9 8 9 9
 16
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
 3
128 1024 2048
 10
3 3 3 5 5 3 3 3 3 5
 1
0
 2
1 2
 2
0 0
 2
1 1

0
 2
 632
 0
 0
 24
 2
 2
 621247139
 64594
 4
 0
 1
 1
 3
 0

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.HashMap;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        JzzhuAndNumbers solver = new JzzhuAndNumbers();
        solver.solve(1, in, out);
        out.close();
    }

    static class JzzhuAndNumbers {
        int[] nimval = new int[]{0, 1, 2, 1, 4, 3, 2, 1, 5, 6, 2, 1, 8, 7, 5, 9, 8, 7, 3, 4, 7, 4, 2, 1, 10, 9, 3, 6, 11, 12};
        int N = 25;
        HashMap<Integer, Integer> nim = new HashMap<>();

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            N = in.nextInt();
//        int[] arr = new int[N];
//        for (int i = 0; i < arr[N-1]; i++) {
//            arr[i] = in.nextInt();
//        }
//        for (int N = 5; N <= 52; N++) {
            int[] length = new int[30];
            int sqrt = (int) (Math.sqrt(N));
            boolean[] seen = new boolean[sqrt + 1];
            length[1]++;
            int tot = N - sqrt;
            for (int i = 2; i <= sqrt; i++) {
                if (!seen[i]) {
                    int iter = 0;
                    for (int j = i; j <= N; j *= i) {
                        iter++;
                        if (j > sqrt) {
                            tot--;
                        } else {
                            seen[j] = true;
                        }
                        if (N / i < j) {
                            break;
                        }
                    }
                    length[iter]++;
                }
            }
            nim.put(0, 0);
//            for (int i = 1; i <= 29; i++) {
//                out.println(find((1<<i)-1));
//            }
            length[1] += tot;
//            out.println(Arrays.toString(length));
            int t = 0;
            for (int i = 1; i < 30; i++) {
                if (length[i] % 2 == 1) {
                    t ^= nimval[i];
                }
            }
            if (t == 0) {
                out.println("Petya");
            } else {
                out.println("Vasya");
            }
//        }
//        if (N%2 == 0) {
//            out.println("Petya");
//        }
//        else {
//            out.println("Vasya");
//        }
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

