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

struct Node{
    int data;
    struct Node *next;
};

int main(){
    int n, i ,val;
    struct Node *head = NULL, *temp = NULL, *newNode;
    int foundEven = 0;
    
    if(scanf("%d", &n) != 1 || n <= 0){
        printf("Invalid input");
        return 0;
    }
    
    for(i = 0; i < n; i++){
        if(scanf("%d", &val) != 1){
            printf("Invalid input");
            return 0;
        }
        newNode = (struct Node *)malloc(sizeof(struct Node));
        newNode->data= val;
        newNode->next=NULL;
        
        if(head == NULL){
            head = newNode;
            temp = head;
        }else{
            temp->next = newNode;
            temp = newNode;
        }
    }
    
    temp = head;
    while(temp != NULL){
        if(temp->data % 2 ==0){
            if(foundEven)
            printf(" ");
        printf("%d", temp->data);
        foundeven = 1;
        }
        temp = temp->next;
    }
    
    if(!foundEven){
        printf("Empty");
    }
    return 0;
}