#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
  int N;
  cin>>N;
  vector<string> S(N);
  unordered_set<string> s;
  for(int i=0;i<N;i++){
      cin>>S[i];
      bool ok = true;
      for(int j=1;j<S[i].size();j++){
          swap(S[i][j],S[i][j-1]);
          if(s.count(S[i])){
              ok = false;
              swap(S[i][j],S[i][j-1]);
              break;
          }
          swap(S[i][j],S[i][j-1]);
      }
      cout<<((ok && !s.count(S[i])) ? "No" : "Yes")<<endl;
      s.insert(S[i]);
  } 
}