#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;
typedef long long LL ;
#define rep( i , a , b ) for ( int i = ( a ) ; i <  ( b ) ; ++ i )
#define For( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i )
#define rev( i , a , b ) for ( int i = ( a ) ; i >= ( b ) ; -- i )
#define clr( a , x ) memset ( a , x , sizeof a )
const int MAXN = 100005 ;
const int N = 26 ;

struct Palindromic_Tree {
    int next[MAXN][N] ;
    int fail[MAXN] ;
    int cnt[MAXN] ;
    int len[MAXN] ;
    int S[MAXN] ;
    int last ;
    int n ;
    int p ;

    int newnode ( int l ) {
        for ( int i = 0 ; i < N ; ++ i ) next[p][i] = 0 ;
        cnt[p] = 0 ;
        len[p] = l ;
        return p ++ ;
    }

    void init () {
        p = 0 ;
        newnode (  0 ) ;
        newnode ( -1 ) ;
        last = 0 ;
        n = 0 ;
        S[n] = -1 ;
        fail[0] = 1 ;
    }

    int get_fail ( int x ) {
        while ( S[n - len[x] - 1] != S[n] ) x = fail[x] ;
        return x ;
    }

    int add ( int c ) {
        c -= 'a' ;
        S[++ n] = c ;
        int cur = get_fail ( last ) ;
        if ( !next[cur][c] ) {
            int now = newnode ( len[cur] + 2 ) ;
            fail[now] = next[get_fail ( fail[cur] )][c] ;
            next[cur][c] = now ;
        }
        last = next[cur][c] ;
        cnt[last] ++ ;
        return last ;
    }

    void count () {
        for ( int i = p - 1 ; i >= 0 ; -- i ) cnt[fail[i]] += cnt[i] ;
    }
} ;

Palindromic_Tree T, T2 ;
int n ;
int len[MAXN], len2[MAXN] ;
int node[MAXN];
char s[MAXN] ;

void solve () {
    int ans = 0 ;
    T.init (), T2.init() ;
    n = strlen ( s ) ;
    if (n <= 2) {
        puts("No");
        return;
    }
    for (int i = n - 1; i >= 0; --i)    len2[i] = T2.len[T2.add(s[i])];
    bool f = 0;
    rep ( i , 0 , n - 1 ) {
        node[i] = T.add ( s[i] ) ;
        len[i] = T.len[node[i]] ;
        if ( i - len[i] >= 0 && i >= 1) {
            if (len[i] + len[i - len[i]] == i + 1 && len2[i + 1] == n - i - 1) f = 1;
        }
         if (i >= 1 &&  T.len[T.fail[T.last]] + T.len[node[i - T.len[T.fail[T.last]]]] == i + 1 && len2[i + 1] == n - i - 1) f = 1;

    }
    printf("%s\n", f ? "Yes" : "No");
}

int main () {
    int t;
    scanf("%d", &t);
    while (t--) {
        scanf("%s", s);
        solve () ;
    }
    return 0 ;
}