#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,m;
int a[100001],b[100001];
int read()
{int sum=0,fg=1; char c=getchar();while(c>'9'||c<'0'){if(c=='-')fg=-1;c=getchar();}while(c<='9'&&c>='0'){sum=sum*10+c-'0';c=getchar();}return fg*sum;
}
int main()
{
//    freopen("number.in","r",stdin);freopen("number.out","w",stdout);n=read();for(int i=1;i<=n;i++)a[i]=read();sort(a+1,a+1+n);m=read();for(int i=1;i<=m;i++)b[i]=read();sort(b+1,b+1+m);int k=1;for(int i=1;i<=n;i++){if(a[i]==b[k])k++;else cout<<a[i]<<" ";}
//    fclose(stdin);fclose(stdout);
}

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,ans,maxn;
int a[2000001];
int read()
{int sum=0,fg=1; char c=getchar();while(c>'9'||c<'0'){if(c=='-')fg=-1;c=getchar();}while(c<='9'&&c>='0'){sum=sum*10+c-'0';c=getchar();}return fg*sum;
}
int main()
{
//    freopen("math.in","r",stdin);freopen("math.out","w",stdout);n=read();int x;for(int i=1;i<=n;i++){x=read();a[x]++;maxn=max(maxn,x);}for(int i=2;i<=maxn;i++){int sum=0;for(int j=i;j<=maxn;j+=i){sum+=a[j];}ans=max(ans,sum);}printf("%d",ans);
//    fclose(stdin);fclose(stdout);
}

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
int n,m,ans;
int dx[9]={0,0,1,1,1,-1,-1,-1};
int dy[9]={-1,1,0,-1,1,0,-1,1};
char a[1005][1005];        //数组[1001]完蛋
int map[1005][1005];
struct ahah{int x,y;
}cur,str,kpl;
int read()
{int sum=0,fg=1; char c=getchar();while(c>'9'||c<'0'){if(c=='-')fg=-1;c=getchar();}while(c<='9'&&c>='0'){sum=sum*10+c-'0';c=getchar();}return fg*sum;
}
queue <ahah> que;
bool vis[1005][1005];
void bfs(int x,int y)
{kpl.x=x;kpl.y=y;vis[x][y]=1;que.push(kpl);while(!que.empty()){str=que.front();que.pop();for(int i=0;i<8;i++){cur.x=str.x+dx[i];cur.y=str.y+dy[i];if(cur.x>=1&&cur.x<=n&&cur.y>=1&&cur.y<=m&&!vis[cur.x][cur.y]&&a[cur.x][cur.y]!='*'){vis[cur.x][cur.y]=1;if(map[cur.x][cur.y]==0)que.push(cur); }}}
}
int main()
{
//    freopen("mine.in","r",stdin);freopen("mine.out","w",stdout);n=read();m=read();for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){cin>>a[i][j];if(a[i][j]=='*'){map[i][j-1]++;map[i][j+1]++;map[i+1][j]++;map[i-1][j]++;map[i+1][j+1]++;map[i+1][j-1]++;map[i-1][j+1]++;map[i-1][j-1]++;}}}for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){if(map[i][j]==0&&!vis[i][j]&&a[i][j]!='*'){bfs(i,j);ans++;        }}}for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){if(!vis[i][j]&&a[i][j]!='*')ans++;}}printf("%d",ans);
//    fclose(stdin);fclose(stdout);
}
//附上组数据
/*
输入：
1 16
...*....*.*.*.*.输出：6
*/