#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=10005;
bool flag=false;
int val[maxn],n,m;
int res[maxn],pos=0;//输出结果

void dfs(bool in,int step,int sum,int sur,int V)//in 表示是否用step个硬币,sur--剩余硬币价值和，V还需要多少价值才能填满
{
  if(sur<V||sum>m||flag||step>n||m<val[step])return;//剪枝
  if(sum==m)
  {
    //cout<<"YES"<<endl;
    flag=true;
    return;
  }
  if(in)
  {
    sum+=val[step];
    res[pos]=step;
    pos++;
    dfs(true,step+1,sum,sur-val[step],V-val[step]);
    pos--;
    res[pos]=step;
    pos++;
    dfs(false,step+1,sum,sur-val[step],V-val[step]);
    pos--;
    sum-=val[step];
  }
  else
  {
    dfs(true,step+1,sum,sur,V);
    dfs(false,step+1,sum,sur,V);
  }
}
int main()
{
  scanf("%d",&n);
  int all=0;
  for(int i=0;i<n;i++)
  {
    scanf("%d",&val[i]);
    all+=val[i];
  }
  scanf("%d",&m);
  sort(val,val+n);
  dfs(true,0,0,all,m);
  dfs(false,0,0,all,m);
  if(!flag)cout<<"0";
  else{
    cout<<"1";
  }
  cout<<endl;
}