#include<bits/stdc++.h>
using namespace std;

struct hashuri
{
    vector<int> elem;
}v[666019];

int hashh (int val)
{
    int nr=0;
    while (val)
    {
        nr=nr*5+val%10;
        nr=nr%666013;
        val/=10;
    }
    return nr;
}

/**
la v[i] tineti elementele cu hashul egal cu i
*/

int findd (int hashval,int nr)
{
        for (int i=0;i<v[hashval].elem.size();++i)
        {
            if(v[hashval].elem[i]==nr) return i;
        }
        return -1;
}

int adauga (int nr)
{
    int pos=findd(hashh(nr),nr);
        if(pos!=-1) v[pos].push_back(nr);
    ///verifica daca la adresa din vector a hashului lui nr se afla nr
}


void del (int nr)
{
            v[hashval].elem.erase(v[hashval].elem.begin()+i);
}
bool vef(int v[]){

    for(int i=0;i<v[hashval].elem.size();i++){
        if(v[i]==nr) return true;
        else return false;
    }

}
queue <int> q;
int main(){

    ifstream fin("hashuri.in");
    ofstream fout("hashuri.out");

int n;

if(vef(v)==true) fout<<"1"<<"\n";
else fout<<"0"<<"\n";











return 0;
}