yes
no
0#5
1#1
2#6
3#NULL
4#NULL

#include<stdio.h>
#include <string.h>
#include<stdlib.h>
int main(){
int hash_len;
int j;
long long key[10000];
int hash[10000];
char op[10];
for(int i=0;i<10000;i++)
hash[i]=-1;
int query;
scanf("%d",&hash_len);
int jj=0;
while(1){
       scanf("%s",op);
       if(strcmp(op,"End")==0)
        break;
        if(strcmp(op,"Add")==0){
            scanf("%lld",&key[jj]);
            int h = key[jj]%hash_len;//雜湊取模
            int conflic = 1;//用於解決衝突的計數器
            int ii=0;
            while(1){
                 if(hash[h]==-1) {//沒有雜湊地址衝突
                        hash[h] = key[jj];
                       break;
                }
                 else {
                h= h+conflic*conflic-ii*ii;
                if((h+conflic*conflic-ii*ii)>=hash_len){
                        h%=hash_len;//連結串列迴圈
                    }
                ii++;
                conflic++;
                 }
               
           }
       jj++;
        }
        if(strcmp(op,"Print")==0){
            for(int i=0;i<hash_len;i++){
               printf("%d",i);
               printf("#");
               if(hash[i]==-1)
                   printf("NULL\n");else
                   printf("%d\n",hash[i]);
            }
        }
        if(strcmp(op,"Query")==0){
            int exit=0;
            scanf("%d",&query);
            for(int i=0;i<hash_len;i++){
                if(hash[i]==query)
                    exit=1;
            }

                    if(exit)
                        printf("yes\n");
                else
                    printf("no\n");
            }
        }
return 0;
}