#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
 
void penguin_party(int T, int test_cases[][100000], int sizes[]) {
    for (int t = 0; t < T; t++) {
        int N = sizes[t];
        int* A = test_cases[t];
        long long total_sum = 0;
 
        // Calculate the total sum
        for (int i = 0; i < N; i++) {
            total_sum += A[i];
        }
 
        // Check if total sum is odd
        if (total_sum % 2 != 0) {
            printf("Party's Cancelled\n");
            continue;
        }
 
        long long target_sum = total_sum / 2;
        bool* dp = (bool*)calloc(target_sum + 1, sizeof(bool));
        dp[0] = true;
 
        // Dynamic programming to find if target_sum is achievable
        for (int i = 0; i < N; i++) {
            for (long long j = target_sum; j >= A[i]; j--) {
                if (dp[j - A[i]]) {
                    dp[j] = true;
                }
            }
        }
 
        if (dp[target_sum]) {
            printf("Party Time!\n");
        } else {
            printf("Party's Cancelled\n");
        }
 
        free(dp);
    }
}
 
int main() {
    int T = 2;
    int test_cases[2][100000] = {
        {2, 2},
        {1, 2, 4, 3}
    };
    int sizes[2] = {2, 4};
 
    penguin_party(T, test_cases, sizes);
 
    return 0;
}