semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
int main()
{	int i,j,n,c,k,l,m,x=1;
    char a[100000],b[26];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{	x=1;
		for(j=0;j<26;j++)
			b[j]=' ';
		scanf("%s",a);
		c=strlen(a);
		l=0;
		for(j=0;j<c;j++)
		{	for(k=0;k<26;k++)	
			{	if(a[j]==b[k])
				{	a[j]=' ';
					for(m=0;m<c;m++)
					{	if(a[m]==b[k])
							a[m]=' ';
					}
					break;
				}
				else if(k==25)
				{	b[l]=a[j];
						l++;
				}
			}
		
		}
		for(j=0;j<c;j++)
		{	if(a[j]!=' ')
			{	printf("%c\n",a[j]);
				x=0;
				break;
			}
		}
		if(x==1)
			printf("no\n");
	}
	return 0;
}
int main()
{
	char ltr[100000];
	int n;
	int i;
	char *p,*t;
	int count=0;
	int k=0;

	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%s",ltr);
		for(p=ltr;p<ltr+strlen(ltr);p++){
			for(t=ltr;t<ltr+strlen(ltr);t++){
				if(*t==*p){
					count++;
				}
			}
			if(count==1){
				k++;
				printf("%c\n",*p);
				break;
			}
			count=0;
		}
		if(k==0){
			printf("no\n");
		}
		count=0;
		k=0;
	}
	return 0;
}
main()
{
int t,i,u,k,m,y,x,min,a[100002];
char str[100002];
scanf("%d",&t);
for(i=0;i<t;i++)
{
                scanf("%s",&str);
                u=strlen(str);
            for(k=0;k<u;k++)
              { a[k]=0;
                for(m=0;m<u;m++)
                {
                if(str[m]==str[k])
                a[k]++;
                }
              }
            for(y=0,min=a[0],x=0;x<u;x++)
            {
               if(a[x]<min)
               {min=a[x];
                y=x;}
            }
            if (min==1)
            printf("%c\n",str[y]);
            if (min>1)
            printf("no\n");
            
}
}
//*????1000012912_002.cpp
//*??????
//*?????2010.11.17
//*???????????????
int main()
{
	int flag, t, i, j, k, len;             
	char letter[100000];                       
	cin >> t;
	for ( i = 0; i < t; i ++ )
	{
		cin >> letter;
		len = strlen(letter);
		for ( j = 0; j < len; j ++ )
		{
			flag = 1;
			if ( letter[j] != 0 )
			{
				for ( k = j + 1; k < len; k ++ )
					if ( letter[j] == letter[k] )           //???????
					{
						flag = 0;
						letter[k] = 0;		
					}
				if ( flag!= 0 )                             //?????????
				{
					cout << letter[j] << endl;
					break;
				}
			}
		}
		if ( j == len )                                     //??????????
			cout << "no" << endl;
	}
	return 0;
}
int main()
{
    int t,i,j,k,n,num=0,m,mmin,times=0;
    char s[100000];
    scanf("%d",&t);
    getchar();
    for(i=0;i<t;i++){
                     gets(s);
                     n=strlen(s);
                     mmin=n;
                     times=0;
                     for(j='a';j<='z';j++){
                                           for(k=0;k<n;k++){
                                                            if(s[k]==j){
                                                                        num++;
                                                                        }
                                                            }
                                           if(num==1){
                                                      times++;
                                                      for(k=0;k<n;k++){
                                                                       if(s[k]==j){
                                                                                  m=k;
                                                                                  break;
                                                                                  }
                                                                       }
                                                      if(m<mmin){
                                                                 mmin=m;
                                                                 }
                                                      }
                                           num=0;                                           
                                           }                     
                     if(times==0){
                                  printf("no\n");
                                  }
                     else{
                          printf("%c\n",s[mmin]);
                          }
                     
                     }    
  
    return 0;
    }
int main()
{
    int b=0,i=0,j=0,k=0,n=0;char a;int x[26],y[26];
    cin>>n;getchar();
    for(i=0;i<=25;i++)
    {
                      x[i]=y[i]=0;
    }
    for(k=1;k<=n;k++)
    {for(i=0;i<=25;i++)
    {
                      x[i]=y[i]=0;
    }

                     for(i=1;;i++)
                     {
                            a=getchar(); 
                            if(a=='\n') break; b=a-97;
                            if(x[b]>b+97) continue;
                            
                            if(x[b]==0) y[b]=i;
                            x[b]=x[b]+a;//cout<<b<<"  "<<x[b]<<"  "<<y[b]<<endl;
                     }
                     b=0;
                     for(j=0;j<=25;j++)
                     {
                                       if(y[j]==0) b=b+1;//cout<<b<<endl;
                      }
                      for(j=0;j<=25;j++)
                      {
                                        if(x[j]>j+97) b=b+1;//cout<<b<<endl;
                      }
                      if(b==26) cout<<"no"<<endl;
                      else
                      {
                          for(j=1;j<=100;j++)
                          {
                                                for(i=0;i<=25;i++)
                                                {//cout<<i<<"  "<<x[i]<<"  "<<y[i]<<endl;
                                                                  if(x[i]!=i+97) continue;
                                                                  if(y[i]==j)
                                                                  {
                                                                             a=i+97;
                                                                             break;
                                                                  }
                                                                  
                                                }
                                                if(y[i]==j)
                                                                  {
                                                                             cout<<a<<endl;;
                                                                             break;
                                                                  }
                          }
                      }
     }

return 0;
}
//************************************
//* ????1000012865_2             *
//* ??????                     *
//* ???2010-11-17                 *
//* ???????????????   *
//************************************
int main()
{
	char letters[100001];
	int i, j, t, l;
	cin >> t;
	cin.get();
	for(l = 1; l <= t; l++)
	{
		int  k[100001] = {0},longs = 0; // ????????????
		cin.getline(letters,100001); // ?????
		longs = strlen(letters); // ????
		for(i = 0; i < longs; i++) 
			if(k[i] == 0) // ?????????????
			{
				for(j = i + 1; j < longs; j++) // ??????????
					if(k[j] == 0)
						if(letters[i] == letters[j])
						{
							k[i]++;
							k[j]++;
						}
				if((j == longs) && (k[i] == 0)) // ???????????????????
				{
					cout << letters[i] << endl;
					break;
				}
			}
		if(i == longs && k[i - 1] != 0) // ????????????????no
			cout << "no" << endl;
	}
	return 0;
}
void main()
{
	char *p[10000],*q;
	int n;
	int i,j,k;
	scanf("%d\n",&n);
	for(i=0;i<n;i++)
	{
		p[i]=(char *)malloc(100000*sizeof(char));
		gets(p[i]);
	}
	for(i=0;i<n;i++)
	{
		for(j=0;*(p[i]+j)!='\0';j++)
		{
		    for(k=0;*(p[i]+k)!='\0';k++)
			{
				if(k!=j)
				{
				if(*(p[i]+k)==*(p[i]+j))
					break;
				}
			}
		    	if(*(p[i]+k)=='\0')
				{printf("%c\n",*(p[i]+j));break;}
			
		}
		if(*(p[i]+j)=='\0')
		{printf("no\n");}
	}
			

	
	
}
//???2010?11?17?
//???1000010586_???
//??????????????? 

int main()
{
	int t , len , k , j;
	char str[100][100001] ;
	cin >> t;
	for ( int m = 0 ; m <= t - 1 ; m ++ )
	{
		cin >> str[m];
	}
	for ( int i = 0 ; i <= t - 1 ; i ++ )
	{
		len = strlen( str[i] );
		for (  j = 0 ; j <= len - 1 ; j ++ )
		{
			for (  k = 0 ; k <= len - 1 ; k ++ )
			{
				if ( str[i][j] == str[i][k] && j != k ) break;
			}
			if ( k == len  )
			{
				cout << str[i][j] << endl;
				break;
			}
		}
		if ( j == len  )
			cout << "no" << endl;	
	}
	return 0;
}
int main()
{
	int t,i,sum,k,l;
	char c;
	char alphabet[100000];
	cin >>t;  //????t
	cin.get();  //??????
	for (i=0;i<t;i++) //??t???
	{
		c=getchar();
		for (sum=0;c!='\n';sum++)
		{
			alphabet[sum]=c;
			c=getchar();
		}            //???????????????
		for (k=0;k<(sum-1);)    //???????
		{
			for (l=0;l<sum;)
			{
				if(k==l)
				{
					l=l+1;
				}
				if (alphabet[k]==alphabet[l])
				{
					l=sum+1;    //????????????
				}
				l+=1;
			}
			if (l==sum)
			{
				cout <<alphabet[k]<<endl;
				k=sum;
			}
			k=k+1;
		}
		if (k==(sum-1))
		{
			cout <<"no"<<endl;
		}
	}
	return 0;
}
int main()
{
    int n,i,j,k,l,b,c;
	char a;
	char *s=(char *)malloc(sizeof(char)*100000);
	scanf("%d",&n);
	for(i=0;i<n;i++){
	    scanf("%s",s);
		l=strlen(s);
		c=0;
		for(j=0;j<l;j++){
            a=*(s+j);
			b=0;
			for(k=0;k<l;k++){
				if(k!=j&&*(s+k)==a) {b++; break;}
			}
			if(b==0){
			    printf("%c\n",a);
				c++;
				break;
			}
		}
		if(c==0) printf("no\n");        
	}
    return 0;
}
//****************************************
//*??: ????????????       **
//*????? 1100012816                **
//*???2011.11.8                      **
//****************************************
int main()//???
{//?????
	int t,i,j,k,num[100000] = {0},flag = 0;//????
	char str[100000];//???????????
	cin >> t;//??????????
	cin.get();//??cin????
	for(i = 1;i <= t;i++)
	{
		cin.getline(str,100000);//???????
		for(j = 0;j < strlen(str);j++)//?????????????????????????
		{
			for(k = 0;k < strlen(str);k++)
			{
				if(str[j] == str[k])//??????
				{
					num[j]++;//????????
				}
			}
		}
		for(j = 0;j < strlen(str);j++)
		{
			if(num[j] == 1)//???????????????????????????????????
			{
				cout << str[j] << endl;//?????
				flag = 1;//???flag?1
			}
			if(flag == 1)//??flag?1?????????????????
				break;
		}
		if(flag == 0)//??flag?0??????????????
			cout << "no" << endl;//??no
		flag = 0;//flag??
		memset(num,0,sizeof(num));//??????
	}
	return 0;
}//?????
//*****************************
//*??? : ???????????? *
//*??   : ???                   *
//*??   : 2011?10?               *
//*****************************
int main ()
{
	int t, i, j, g = 0, k, m, count = 0;
	char a[1000];
	cin >> t;
	cin.get();
    for (k = 1; k <= t; k++)
	{
		cin.getline(a, 10000, '\n');
		m = strlen(a);
		for (i = 0; i < m; i++)
		{
			for (j = 0; j < m; j++)
			{
				if (a[i] == a[j])
				{
					count++;
				}
			}
			if (count == 1)
			{
				cout << a[i] << endl;
				g = 1;
				count = 0;
				break;
			}
			count = 0;
			g = 0;
		}
		if (g ==0) cout << "no" <<endl;
	}
	return 0;
}
/**
 * ? ? ??????????????
 * ?    ?????
 * ????: 2010?11?19?
 * ???????t??????????????26?????????????????????????????????????no
*/
int main()
{
	int t, i, len;		//????t????????????len????????
	int count[26];		//??????????26????????
	char a[100000];		//??????
	cin>>t;
	while (t--)
	{
		i = 0;
		cin>>a;
		memset(count,0,sizeof(count));	//???count?????0
		len = strlen(a);		//????????
		for ( i = 0; i < len; i++ )
			count[a[i] - 'a']++;		//???????????
		for ( i = 0; i < len; i++ )
			if ( count[a[i] - 'a'] == 1 )	//??????????????????
			{
				cout<<a[i];
				break;
			}
			if ( i == len )		//?????????????????no
				cout<<"no";
			if ( t >= 0 )		
				cout<<endl;
	}
	return 0;
}
int main()
{
    int t;
    scanf("%d",&t);
    for (int c=1;c<=t;c++)
    {
    char a[100000];
    scanf("%s",&a);
    int l=strlen(a),sum=l;
    int app=0;
    for (int i=0;i<=l-1;i++)
    {
        for (int j=0;j<=l-1;j++)
        {
        if (a[i]==a[j])
        app++;
        }
        if (app==1)
        {
                   printf("%c\n",a[i]);
                   break;
        }
        app=0;
        sum--;
    }
    if (sum==0)
    printf("no\n");
    }
    


    

}
// tiaoshi.cpp : Defines the entry point for the console application.
//



int main()
{
	int n,i,j;
	char a[100001];
	scanf("%d",&n);
	for(i=1;i<=n;++i)
	{
		scanf("%s",&a);
		int l=strlen(a)-1;
		int b[123],c[123],k;
		for(j=0;j<=122;++j) 
		{
			b[j]=0;
			c[j]=0;
		}
		for(j=0;j<=l;++j)
			for(k=97;k<=122;++k)
				if(a[j]==k) b[k]++;
		int flag=0;
		k=0;
		for(j=97;j<=122;++j)
			if(b[j]==1)
			{
				flag=1;
				c[k]=j;
				k++;
			}
		if(flag==0) printf("no\n");
		else
		{
		int p=0;
		for(j=0;j<=l;++j)
		{
			for(p=0;p<=k-1;++p)
			{
				if(a[j]==c[p])
				{
					printf("%c\n",a[j]);
					break;
				}
			}
			if(a[j]==c[p]) break;
		}
		}
	}
	return 0;
}
main()
{
      char a[100000];
      int b,c,d,e,f,h;
      int g[100000];
      scanf("%d",&b);
      for(c=0;c<b;c++)
      {
      for(h=0;h<100000;h++)
      g[h]=0;
      scanf("%s",a);
      e=strlen(a);
      for(d=0;d<e-1;d++)
      {
      for(f=d+1;f<e;f++)
      {
                        if(a[f]==a[d])
                        {
                        g[f]++;
                        g[d]++;
                        }
                        }
                        if(f==e&&g[d]==0)
                        {
                        printf("%c\n",a[d]);
                        break;
                        }
                        }
      if(d==e-1)
      printf("no\n");
      }
      }
int main(){
	int i,j,t,k,x,y;
	char a[10000];
	scanf("%d",&t);
    for(k=1;k<=t;k++){
		scanf("%s",a);
        for(i=0;a[i]!='\0';i++){
			x=0;
			y=0;
			for(j=0;a[j]!='\0';j++){
				if(a[j]==a[i]){
					x=x+1;
				}
			}
			if(x==1){
				printf("%c\n",a[i]);
				y=1;
				break;
			}
		}
		if(y==0){
			printf("no\n");
		}
	}		
	return 0;
}
int main()
{
	int count[26]; //???26?????????????????
	char s[100000];
	int n;
	scanf("%d\n",&n);
	while( n > 0 )
	{
		int i;
		for( i = 0; i < 26; i++ )  //??????????????count??
			count[i] = 0;

		gets( s );
		i = 0;
		while( s[i] != '\0' )  //?????????????????
		{
			count[ s[i] - 'a' ] ++; //??????????????????????
			i++;
		}

		int flag = 0;
        
		i = 0;
		while( s[i] != '\0' )
		{
			if( count[ s[i] - 'a' ] == 1 )
			{
				printf( "%c\n", s[i] );
				flag = 1;                 //??????????????
				break;
			}

			i++;
		}

		if( flag == 0 )  //???????????????????
		{
			printf("no\n");
		}

		n--;
	}
	return 0;
}
int main(){
int n,i,m,b=0,c=0;
char a[100000];
char *p,*q;
scanf("%d",&n);
for(i=0;i<n;i++){
	scanf("%s",a);
	m=strlen(a);
	for(p=a;p<a+m;p++){
		for(q=a;q<a+m;q++){
			if((*p)==(*q)&&p!=q){
				b=1;
				break;
			}	
		}
		if(b==0){
			printf("%c\n",*p);
			c=1;
			break;
		}
		b=0;
	}
	if(c==0){
		printf("no\n");
	}
	c=0;
	
}
return 0;
}
void pr(char *a)
{
    int l,i,j,num[26];
    for(i=0;i<26;i++)
    {
        num[i]=0;
    }
    l=strlen(a);
    for(i=0;i<l;i++)
    {
        num[a[i]-'a']+=1;
    }
    for(i=0,j=0;i<26;i++)
    {
        if(num[i]!=1)j++;
        if(j==26)printf("no\n");
    }
    if(j!=26)
    {
        for(i=0;i<l;i++)
        {
            if(num[a[i]-'a']==1)
            {
                printf("%c\n",a[i]);
                break;
            }
        }
    }
}
main()
{
    int t,i;
    char a[100000];
    scanf("%d",&t);
    for(i=0;i<t;i++)
    {
        scanf("%s",a);
        pr(a);
    }
}
int main()
{
	int n,i,j,l,k;
	char M[100][10000];
	cin>>n;
	for ( i=0 ; i<n ; i++ )
	{
		cin>>M[i];
		l=strlen(M[i]);
		for ( j=0 ; j<l ; j++ )
		{
			for ( k=0 ; k<l ; k++ )
			{
				if ( M[i][k]==M[i][j]&&k!=j )
					break;
			}
			if ( k==l )
			{
				cout<<M[i][j]<<endl;
				break;
			}
		}
		if ( j==l )
			cout<<"no"<<endl;
	}
	return 0;
}
main()
{
	int n,i,j,k;
	scanf("%d",&n);
	char a[233333];
	for(k=0;k<n;k++)
	{
		int b[233333]={0};
		scanf("%s",a);
		for(i=0;a[i]!='\0';i++)
		{
			for(j=0;a[j]!='\0';j++)
			{
				if(a[i]==a[j])
				b[i]++;
			}
		}
		j=0;
		for(i=0;a[i]!='\0';i++)
		{
			if(b[i]==1)
			{
				j=1;
				break;
			}
		}
		if(j==0)
		{
			printf("no\n");
		}
		else
		printf("%c\n",a[i]);
	}
}
int main ()
{
	char a[100000];
	int b[100000];
	int n,i,j,k,c,d;
	scanf("%d",&n);
		
	for(i=1;i<=n;i++)
	{
         scanf("%s",a);
	
		for(j=0;a[j];j++)
		{
			
			c=0;
			for(k=0;a[k];k++)
			{
				if(a[k]==a[j])
			    c++;
			}
			b[j]=c;
		}
		d=-1;
		for(k=0;a[k];k++)
		{
			if(b[k]==1)
			{
				printf("%c\n",a[k]);
				d++;
				break;
			}
		}
		if(d!=0)
		{printf("no");}
	}
	return 0;
}
void main()
{
	char s[100005],*p,*q;
	int n,i,k,t;
	scanf("%d\n",&n);
	for(i=0;i<n;i++)
	{
		gets(s);
		t=strlen(s);
		k=0;
		for(p=s;p<s+t&&k==0;p++)
		{
			k=1;
			if(*p!='0'&&*p!='\0')
			{
				q=p+1;
				while(q<s+t)
				{
					if(*q!=*p)
						q++;
					else 
					{
						*q='0';
						k=0;
						q++;
					}
				}
				if(k)
					printf("%c\n",*p);
			}
			else k=0;
		}
	}
		if(k==0)
			printf("no");
}
void main()
{
	int t,i,j,len,d;
	char str[100000];
	scanf("%d",&t);
	for(d=0;d<t;d++)
	{
		scanf("%s",str);
		len=strlen(str);
		for(i=0;i<len;i++)
		{
			for(j=0;j<len;j++)
			{
				if(i==j)
				{
				
					continue;
				}
				else if(str[i]==str[j])
					break;
			}
			if(j>=len)
			{
				printf("%c\n",str[i]);
				break;
			}
		}
		if(i>=len)
			printf("no\n");
	}
}
int main()
{
    int t,i,j,k;
    int l,count;
    char a[100000];
    scanf("%d",&t);
    for(i=1;i<=t;i++)
    {
        scanf("%s",a);
        l=strlen(a);
        for(j=0;j<l;j++)
        {
            count=0;
            for(k=0;k<l;k++)
                if(a[k]==a[j])
                    count++;
            if(count==1)
            {
                printf("%c\n",a[j]);
                break;
            }
            else if((j==l-1)&&(count!=1))
                printf("no\n");
        }
    }
}
int main()
{
	int t=0,i=0,j=0,k=0,l=0,*n,m=0;
	char **p,a;
	n=(int*)malloc(26*sizeof(int));
	scanf("%d",&t);
	a=getchar();
	p=(char**)malloc(100*sizeof(char*));
	for(i=0;i<t;i++)
	{
		for(k=0;k<26;k++)
		{
			*(n+k)=-1;
		}
		*(p+i)=(char*)malloc(100000*sizeof(char));
		gets(*(p+i));
		l=strlen(*(p+i));
		for(j=0;j<l;j++)
		{
			for(k=0;k<26;k++)
			{
				if(*(*(p+i)+j)==(97+k))
				{
					if(*(n+k)==-1)
					{
						*(n+k)=j;
					}
					else if(*(n+k)!=-1)//????else???
					{
						*(n+k)=-2;
					}
				}
			}
		}
		m=l;
		for(k=0;k<26;k++)
		{
			if((*(n+k)<m)&&(*(n+k)!=-1)&&(*(n+k)!=-2))
			{
				m=*(n+k);
			}
		}
		if(m!=l)
			printf("%c\n",*(*(p+i)+m));
		else
			printf("no\n");
	}
	return 0;
}
main()
{
	int n,i;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
	  char a[100001]	;
	  scanf("%s",a);
	  int k,j,p,q=0,count;
	  p=strlen(a);
	  for(k=0;k<p-1;k++)
	  {
	  	count=1;
	  	if(a[k]=='@') continue;
	  	for(j=k+1;j<p;j++)
	  	{
	  		if(a[k]==a[j])
	  		{
	  			a[j]='@';
	  			count=0;
	  		}
	  	}
	  	if (count==1) {printf("%c",a[k]);break;} 
	  }
	  if (k==p-1) printf("no");
	  printf("\n");
	}
}
int main()
{
	char str[100000], *p, d;
	int len, n, i, j, c, pos;
	cin >> n;
	for (i = 0; i < n; i++)
	{
		cin >> str;
		len = strlen(str);
		int f[26] = {0}, po[26], min = 2000000;
		for (p = str + len - 1; p >= str; p--)
		{
			c = *p - 'a';
			f[c]++;
			po[c] = p - str;
		}
		for (j = 0; j < 26; j++)
		{
			if (f[j] == 1)
			{
				if (po[j] < min)
				{
					min = po[j];
					d = j + 'a';
				}
			}
		}
		if (min == 2000000)
			cout << "no" << endl;
		else
			cout << d << endl;
	}
	return 0;
}
int main()
{
	int t,k;
	char s[M];
	scanf("%d",&t);
	for(k=0;k<t;k++)
	{
		int count[M]={0},flag=0;
		int n,i,j;
		scanf("%s",s);
		n=strlen(s);
		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
			{
				if(s[j]==s[i])
					count[i]++;
			}
		}
		for(i=0;i<n;i++)
		{
			if(count[i]==1)
			{
				printf("%c\n",s[i]);
				flag=1;
				break;
			}
		}
		if(flag==0)
			printf("no\n");
	}
	
	return 0;
}
int main()
{
	char a[999999],b[26]={'\0'};
	int t,i,j,k,sum[26]={0},pp=0,qq=0,num=0;
	cin >>t;
	cin.get();
	for (k=1;k<=t;k++)
	{
		cin.getline(a,999999);
		b[0]=a[0];
		sum[0]=1;
		for (i=1;a[i]!='\0';i++)
		{
			for (j=0;j<26;j++)
			{
				if (a[i]==b[j])
				{
					sum[j]++;
					pp++;
				}
			}
			if (pp==0) 
			{
				num++;
				b[num]=a[i];
				sum[num]=1;
			}
			pp=0;
		}
		for (j=0;j<26;j++)
		{
			if (sum[j]==1&&qq==0)
			{
				cout <<b[j]<<endl;
				qq++;
			}
		}
		if (qq==0) cout <<"no"<<endl;

	//	cout <<num<<" "<<sum[0]<<sum[1]<<sum[2]<<" "<<b[0]<<b[1]<<b[2];
		
		pp=0;qq=0;num=0;
		for (j=0;j<26;j++) {sum[j]=0;b[j]='\0';}
		for (j=0;j<=999990;j++) a[j]='\0';
		
	}
	
	
	return 0;
}
int main()
{
	char str[100000]={'\0'},*p;
	int len,t,flag;
	cin>>t;
	cin.get();
	for(int i=0;i<t;i++)
	{
		cin.getline(str,100000);
		len=strlen(str);
		for(int i=0;i<len;i++)
		{
			if(str[i]>='a'&&str[i]<='z')
			{
			flag=0;
			for(int j=i+1;j<len;j++)
			{
				if(str[i]==str[j])
				{
					flag=1;
					str[j]='0';
					break;
				}
			}
			if(flag==0)
			{
				cout<<str[i]<<endl;
				break;
			}
			}
		}
		if(flag==1)
		{
			cout<<"no"<<endl;
		}
	}
	return 0;
}
int main()
{
	int t, p = 1;
	cin >> t;
	cin.get();
	char ch[100000];
	while(p <= t)
	{
		cin.getline(ch, 100000);
		int i = 0, flag = 0;
		while(ch[i] != '\0')
		{
			while(ch[i] == '0' ) i ++;
			int count = 0;
			for (int j = i + 1; ch[j] != '\0'; j ++)
			{
				
				if (ch[i] == ch[j])
				{
					ch[j] = '0';
					count  ++;
				}
			}
				if (count == 0 && ch[i] >='a'&&ch[i]<='z')
				{
					cout << ch[i] << endl;
					flag = 1;break;
				}
			   i ++;
			if (flag == 1) break;
		}	
    	if (flag == 0)
			cout << "no" << endl;
		p ++;
	}
	return 0;
}
int main()
{
char zfc[1000],tmp;
int n,i,t,e,f;

scanf("%d",&n);
for(i=0;i<n;i++){

scanf("%s",zfc);
for(t=0;zfc[t]!='\0';t++){f=0;
	for(e=0;1;e++){
		if(zfc[t]==zfc[e]&&t!=e){
		break;}
		else if(e==strlen(zfc)){
		printf("%c\n",zfc[t]);
		f=1;
		break;
		}
		
	}
if(f==1){break;}
}
if(f==0){
printf("no\n");}

}

	return 0;
}
//*************************************************************
//*           ??????????????                    *
//*                  ?????1000010573                     *
//*                  ?????2010?11?                     *         
//*************************************************************


int main( )
{
	int t = 0 ;
	cin>>t;
		cin.get();
	for(int r = 0 ; r<t+1 ;r++) 
	{
	
		char str[111] ;//??????
	    int count[30] = {0};//????????????? 
	    int L , c ;
	    char z ;
	    cin.getline(str,111);//??????
	    //?????????????count?? 
	    L = strlen(str);//???????????? 
	    for(int i = 0 ; i<L ; i++)
    	{
			c = str[i] - 'a' ;
			count[c]++;
    	} 
	    for(int j = 0 ; j < L ; j++)
	    {
		    if(count[str[j]-'a']==1)
		    {
			    z = str[j] ;
			    cout<<z<<endl;
			    break;
		    }
		    if(j==L-1)
		    {
			    cout<<"no"<<endl;
			    break;
		    }
	    }
		
	}
	return 0; 
}
main()
{

int t,i=1,m;
scanf("%d",&t);
while(i<=t)
{char zifu[100000],q='0';
scanf("%s",&zifu);
m=strlen(zifu);
int k=0,j=0;
while(k<=m-2)
{j=0;
	while(j<=m-1&&q=='0')
	{if(zifu[k]==zifu[j]&&k!=j)
break;
else
j++;}
if(j==m)
{
q=zifu[k];
break;}
else
k++;
}
if(q=='0')
printf("no\n");
else
printf("%c\n",q);


i++;}}
int main()
{
	char c[100];
	int t,i,j,k,l;
	scanf("%d",&t);
	for(i=0;i<t;i++)
	{
		scanf("%s",c);
		l=strlen(c);
		for(j=0;j<l;j++)
		{
			for(k=0;k<l;k++)
			{
				if(c[k]==c[j]&&k!=j) break;
			}
			if(k==l)
			{
				printf("%c\n",c[j]);
				break;
			}
			if(j==l-1) printf("no\n");
		}
	}
	return 0;
}
main()
{
    int l,t,i,j,k,m;
    char s[100001];
    scanf("%d",&t);
    for(k=0;k<t;k++)
    {
        scanf("%s",s);
        l=strlen(s);
        for(i=0;i<l;i++)
        {
            for(j=0;j<i;j++)
                if(s[j]==s[i]) 
                break;
            for(m=i+1;m<l;m++)
                if(s[m]==s[i]) 
                break;
            if(j==i&&m==l) 
            {
                printf("%c\n",s[i]); 
                break;
            } 
       }
       if(i==l) printf("no\n");
}
getchar();
getchar();
}