#include <stdio.h>
#include <stdlib.h>
 
// Function to check if array can be partitioned into two subsets of equal sum
int canPartition(int* nums, int numsSize) {
    long long sum = 0;
    for (int i = 0; i < numsSize; i++) {
        sum += nums[i];
    }
 
    // If sum is odd, it's not possible to partition into two equal subsets
    if (sum % 2 != 0) {
        return 0;
    }
 
    int target = sum / 2;
    char* dp = (char*)calloc(target + 1, sizeof(char));
    dp[0] = 1;
 
    for (int i = 0; i < numsSize; i++) {
        for (int j = target; j >= nums[i]; j--) {
            dp[j] = dp[j] || dp[j - nums[i]];
        }
    }
 
    int result = dp[target];
    free(dp);
    return result;
}
 
int main() {
    int T;
    scanf("%d", &T);
 
    while (T--) {
        int N;
        scanf("%d", &N);
 
        int* A = (int*)malloc(N * sizeof(int));
        for (int i = 0; i < N; i++) {
            scanf("%d", &A[i]);
        }
 
        if (canPartition(A, N)) {
            printf("Party Time!\n");
        } else {
            printf("Party's Cancelled\n");
        }
 
        free(A);
    }
 
    return 0;
}