#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

int a[3000];
int i,n1,n2,n3,c(0);

int main()
{
  scanf("%d",&n1);
  for(i=0;i<n1;i++)
    scanf("%ld\n",&a[i]);

  scanf("%d",&n2);
  for(i=n1;i<n2;i++)
    scanf("%ld\n",&a[i]);

  scanf("%d",&n3);
  for(i=n1+n2;i<n1+n2+n3;i++)
    scanf("%ld\n",&a[i]);

  sort(a,a+n1+n2+n3);
  for(i=1;i<n1+n2+n3;i++)
  {
    if(!(a[i]==a[i-1])) c++;
  }

  printf("%ld",c);

}