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

int* solution(int* pref, int prefSize, int* returnSize) {
    *returnSize = prefSize;
    int* arr = (int*)malloc(prefSize * sizeof(int));
    
    // First element is always same as first prefix
    arr[0] = pref[0];
    
    // For remaining elements, try values until prefix matches
    for (int i = 1; i < prefSize; i++) {
        // Try different values (limiting range for practical purposes)
        for (int val = -1000; val <= 1000; val++) {
            // Calculate XOR from 0 to i with this value
            int currentXor = 0;
            for (int j = 0; j <= i; j++) {
                if (j == i) {
                    currentXor ^= val;
                } else {
                    currentXor ^= arr[j];
                }
            }
            
            if (currentXor == pref[i]) {
                arr[i] = val;
                break;
            }
        }
    }
    
    return arr;
}

int main() {
    char line[10000];
    fgets(line, sizeof(line), stdin);
    
    // Simple parsing for array
    int pref[1000];
    int size = 0;
    char* token = strtok(line, "[,]");
    while (token != NULL) {
        if (strcmp(token, "\n") != 0 && strlen(token) > 0) {
            pref[size++] = atoi(token);
        }
        token = strtok(NULL, "[,]");
    }
    
    int returnSize;
    int* result = solution(pref, size, &returnSize);
    
    printf("[");
    for (int i = 0; i < returnSize; i++) {
        printf("%d", result[i]);
        if (i < returnSize - 1) printf(",");
    }
    printf("]\n");
    
    free(result);
    return 0;
}