#include <cstdio>
#define maxn 666013
#define maxlog 17
int H[maxn][maxlog];

inline int hash1(int val)
{
	while(val>maxn) val-=maxn;
	return val;
}

inline int hash2(int val)
{
	while(val>maxlog) val-=maxlog;
	return val;
}

void insert(int val)
{
	int h1=val%maxn;//hash1(val);
	int h2=h1%maxlog;//hash2(h1);
	H[h1][h2]=val;
}

int find(int val)
{
	int h1=val%maxn;//hash1(val);
	int h2=h1%maxlog;//hash2(h1);
	if(H[h1][h2]==val) return 1;
	return 0;
}

void erase(int val)
{
	int h1=hash1(val);
	int h2=hash2(h1);
	H[h1][h2]=0;
}
int main()
{
	insert(24);
	insert(26);
	insert(27);
	printf("%d %d %d\n", find(24), find(25), find(27));
	
	for(int i=1;i<=1000;i++)
		for(int j=1;j<=1000;j++) insert(i+j);
	for(int i=1;i<=1000;i++)
		for(int j=1;j<=1000;j++) find(i+j);
	
	int p;
freopen("cutii.in", "r", stdin);
scanf("%d", &p);
freopen("cutii.out", "w", stdout);
printf("da\n");
	return 0;
}