#include<stdio.h>
#include<stdlib.h>
struct Node{
    int data;
    struct Node* next;
};
struct Node* createNode(int value){
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->data = value;
    newNode->next = NULL;
    return newNode;
}
void append(struct Node** head, int value){
    struct Node* newNode = createNode(value);
    if (*head == NULL){
        *head = newNode;
        return;
        me:
        temp = temp->next;
    }
    temp->next = newNode;
}
struct Node* removeOdd(struct Node* head){
    while(head !=NULL && head->data % 2 != 0)
       head = head->next;
    if (head == NULL)
    return NULL;
    struct Node* current = head;
    while(current->next !=NULL){
        if(current->next->data % 2 != 0)
          current->next = current->next->next;
        else
        current = current->next;
    }
    return head;
}
void printList(struct Node* head){
    if(head == NULL){
        printf("Empty");
        return;
    }
    struct Node* temp = head;
    while(temp != NULL){
        printf("%d",temp->data);
        if(temp->next != NULL)
             printf("");
             temp=temp->next;
    }
}
int main(){
    int n;
    if(scanf("%d",&n)!= 1){
        printf("Invalid input");
        return 0;
    }
    if(n<1 || n>1000){
        printf("Invalid input");
        return 0;
    }
    struct Node* head=NULL;
    for (int i=0;i<n;i++){
        int(scanf("%d",&val)!= 1){
            printf("Invalid input");
            return 0;
        }
        append(&head,val);
    }
    head = removeOdd(head);
    printList(head);
    return 0;
}