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

#define DEBUG if(0)

void insertionSort(int v[], int size) {
	int i, currentValue, prevIndex;
	for(i = 1; i < size; i++) {
		currentValue = v[i];
		prevIndex = i - 1;
		while(prevIndex >= 0 && currentValue < v[prevIndex]) {
			v[prevIndex + 1] = v[prevIndex];
			prevIndex--;
		}
		v[prevIndex + 1] = currentValue;
	}
}

int main() {
	int size, i, j, index = 0;
	scanf("%d", &size);
	int* a = (int*) malloc(sizeof(int) * size);
	int* b = (int*) malloc(sizeof(int) * size);
	int* inter = (int*) malloc(sizeof(int) * (size * 2));
	for(i = 0; i < size; i++)
		scanf("%d", &a[i]);
	for(i = 0; i < size; i++)
		scanf("%d", &b[i]);
	insertionSort(a,size);
	insertionSort(b, size);
	for(i = 0; i < size; i++) {
		for(j = 0; j < size; j++) {
			if(a[i] == b[j]) {
				inter[index++] = a[i];
			}
		}
	}
	for(i = 0; i < index; i++) {
		printf("%d\n", inter[i]);
		if(inter[i] == inter[i + 1])
			i = i + 1;
	}
	free(a);
	free(b);
	free(inter);
	return 0;
}