#include<stdio.h>
int size,top=-1;
int arr[5];
void enQueue(int num){
    if(isFull()){
        printf("Queue is full");
    }
    else
    arr[++top]=num;
    }
void traverse(int num){
    for(int i=0;i<=top;i++){
        if(arr[i]%n==0){
            printf("%d ",arr[i]);
        }
    }
}
void nonmul(int num){
    for(int i=0;i<=top;i++){
        if(arr[i]%n!=0){
            printf("%d ",arr[i]);
        }
    }
}
int main(){
    int num,itr,n;
    scanf("%d",&size);
    for(itr=1;itr<=size;itr++){
        scanf("%d",&num);
        enQueue(num);
    }
    scanf("%d",&num);
    if(size<0 || n<0){
        printf("Invalid input");
        return 0;
    }
    traverse(num);
    nonmul();
    return 0;
}