import java.util.Array

public class BinarySearch {
    public static int rank (int key, int[] a) {
        if (lo > hi) return -1;
        int lo = 0;
        int hi = a.length - 1;
        int mid = lo + (hi - lo) / 2;
        while (lo <= hi) {
        if (key < a[mid]) hi = mid - 1;
        else if (key > a[mid]) lo = mid + 1;
        else return mid;
        }
        return -1;
    }
    public static void main(String []args) {
        int[] whitelist = In.readInts(arg[0]);
        Array.sort (whitelist);
        while (!StdIn.isEmpty()) {
            int key = StdIn.readInt();
            if (rank (key, whitelist < 0)) {
                StdOut.println(key);
            }
        }
    }
}

public class Counter {
    Counter (String id);
    void increment();
    int tally();
    String toString();
}

public class Flips {
    public static void main (String[] args) {
        int T = Integer.parseInt(args[0]);
        Counter heads = new Counter("heads");
        Counter tails = new Counter("tails");
        for (int t = 0; t < T; t ++) {
            if (StdRandom.bernoulli(0.5))
                heads.increment();
            else tails.increment();
        }
        StdOut.println(heads);
        StdOut.println(tails);
        int d = heads.tally() - tails.tally();
        StdOut.println(Math.abs(d));
    }
}