#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>

bool backtrack(int* arr, int n, int k, bool* used, int pairsFormed, int targetPairs) {
    if (pairsFormed == targetPairs) {
        return true;
    }
    
    // Find first unused element
    int first = -1;
    for (int i = 0; i < n; i++) {
        if (!used[i]) {
            first = i;
            break;
        }
    }
    
    if (first == -1) return false;
    
    used[first] = true;
    
    // Try pairing with all other unused elements
    for (int second = first + 1; second < n; second++) {
        if (!used[second]) {
            if ((arr[first] + arr[second]) % k == 0) {
                used[second] = true;
                if (backtrack(arr, n, k, used, pairsFormed + 1, targetPairs)) {
                    return true;
                }
                used[second] = false;
            }
        }
    }
    
    used[first] = false;
    return false;
}

bool solution(int* arr, int n, int k) {
    bool* used = (bool*)calloc(n, sizeof(bool));
    bool result = backtrack(arr, n, k, used, 0, n / 2);
    free(used);
    return result;
}

int main() {
    char line[1000];
    fgets(line, sizeof(line), stdin);
    line[strcspn(line, "\n")] = 0;
    
    // Parse array manually
    int arr[100];
    int n = 0;
    char* token = strtok(line + 1, ",]");
    while (token != NULL) {
        arr[n++] = atoi(token);
        token = strtok(NULL, ",]");
    }
    
    int k;
    scanf("%d", &k);
    
    bool result = solution(arr, n, k);
    printf(result ? "true\n" : "false\n");
    
    return 0;
}