#if defined(LOCAL)
#include<stdc++.h>
#else
#include<bits/stdc++.h>
#endif
#include<random>
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
//#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define MINF (lint)(2e18)
#define endl "\n"
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define flc(x) __builtin_popcountll(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
#define fi first
#define se second
#define all(x) x.begin(),x.end()
//#define vec vector<lint>
#define nep(x) next_permutation(all(x))
typedef long long lint;
int dx[8]={1,1,0,-1,-1,-1,0,1};
int dy[8]={0,1,1,1,0,-1,-1,-1};
const int MAX_N=3e5+5;
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//vector<int> bucket[MAX_N/1000];
constexpr int MOD107=1000000007;
constexpr int MOD998=998244353;
#include<atcoder/all>
using namespace atcoder;
typedef __int128_t llint;

int main(void){
    int N;
    cin >> N;
    map<vector<int>,set<lint>> nums998,nums107;
    lint pow998[1000010],pow107[1000010];
    pow998[0]=1,pow107[0]=1;
    using mint998=modint998244353;
    using mint107=modint1000000007;
    rep(i,1000005){
        pow998[i+1]=pow998[i]*26;
        pow998[i+1]%=MOD998;
        pow107[i+1]=pow107[i]*26;
        pow107[i+1]%=MOD107;
    }
    while(N--){
        string S;
        cin >> S;
        vector<int> cnt(26);
        rep(i,S.length()) cnt[S[i]-'a']++;
        lint md998=0,md107=0,mul998=1,mul107=1;
        rep(i,S.length()){
            md998+=(S[i]-'a')*mul998;
            md107+=(S[i]-'a')*mul107;
            mul998*=26;
            mul107*=26;
            mul998%=MOD998;
            mul107%=MOD107;
            md998%=MOD998;
            md107%=MOD107;
        }
        if(nums998[cnt].empty()){
            cout << "No" << endl;
        }
        else{
            if(nums998[cnt].count(md998) && nums107[cnt].count(md107)){
                cout << "Yes" << endl;
            }
            else if(S.length()==1){
                cout << "No" << endl;
            }
            else{
                bool ans=false;
                rep(i,S.length()-1){
                    mint998 c998=md998;
                    mint107 c107=md107;
                    c998-=S[i]*pow998[i];
                    c998-=S[i+1]*pow998[i+1];
                    c998+=S[i+1]*pow998[i];
                    c998+=S[i]*pow998[i+1];
                    c107-=S[i]*pow107[i];
                    c107-=S[i+1]*pow107[i+1];
                    c107+=S[i+1]*pow107[i];
                    c107+=S[i]*pow107[i+1];
                    if(nums998[cnt].count(c998.val()) && nums107[cnt].count(c107.val())) ans=true;
                }
                if(ans) cout << "Yes" << endl;
                else cout << "No" << endl;
            }
        }
        nums998[cnt].insert(md998);
        nums107[cnt].insert(md107);
    }
}