output_description: Print C in a line.
input_description: In the first line _n_ is given. In the second line, _n_ integers are given. In
  the third line _q_ is given. Then, in the fourth line, _q_ integers are given.
attempt: n = input()
  n = int(n)
  s = input()
  s = s.split()
  s = [int(x) for x in s]
  
  q = input()
  q = int(q)
  t = input()
  t = t.split()
  t = [int(x) for x in t]
  
  n_unique = len(set(s) - set(t))
  n_overlap = len(s) - n_unique
  print(n_overlap)
  
problem_description: Search II
  
  You are given a sequence of _n_ integers S and a sequence of different _q_
  integers T. Write a program which outputs C, the number of integers in T which
  are also in the set S.
samples: [{"input": "5\n    1 2 3 4 5\n    3\n    3 4 1", "output": "3"}, {"input": "3\n    1 2 3\n    1\n    5", "output": "0"}, {"input": "5\n    1 1 2 2 3\n    2\n    1 2", "output": "2"}]