#include<stdio.h>
#define n_find 0
#define find 1
int b_search(int []);
void sort();
int n;
int q;
int l[100000];
int main(){
  int i;
  int q_n[50000];
  int result=0;
  scanf("%d",&n);
  for(i=0;i<n;i++)scanf("%d",&l[i]);
  sort();
  scanf("%d",&q);
  for(i=0;i<q;i++)scanf("%d",&q_n[i]);
  result+=b_search(q_n);
  printf("%d\n",result);
  return 0;
}
int b_search(int x[]){
  int i;
  int left=0;
  int right=n;
  int mid;
  int flag=0;
  for(i=0;i<n;i++){
    while(left<right){
      mid=(left+right)/2;
      if(l[mid]==x[i])return find;
      else if(x[i]<l[mid])right=mid;
      else left=mid+1;
    }
    return n_find;
  }
}
void sort(){
  int i;
  int j;
  int min;
  int temp;
  for(i=0;i<n-1;i++){
    min=i;
    for(j=i;j<n-1;j++){
      if(l[j]>l[j+1])min=j;
    }
    if(min!=i){
      temp=l[min];
      l[min]=l[i];
      l[i]=temp;
    }
  }
}
  

