#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

struct SuffixArray {
	vi sa, lcp;
	SuffixArray(string& s, int lim=256) { // or basic_string<int>
		int n = sz(s) + 1, k = 0, a, b;
		vi x(all(s)+1), y(n), ws(max(n, lim)), rank(n);
		sa = lcp = y, iota(all(sa), 0);
		for (int j = 0, p = 0; p < n; j = max(1, j * 2), lim = p) {
			p = j, iota(all(y), n - j);
			rep(i,0,n) if (sa[i] >= j) y[p++] = sa[i] - j;
			fill(all(ws), 0);
			rep(i,0,n) ws[x[i]]++;
			rep(i,1,lim) ws[i] += ws[i - 1];
			for (int i = n; i--;) sa[--ws[x[y[i]]]] = y[i];
			swap(x, y), p = 1, x[sa[0]] = 0;
			rep(i,1,n) a = sa[i - 1], b = sa[i], x[b] =
				(y[a] == y[b] && y[a + j] == y[b + j]) ? p - 1 : p++;
		}
		rep(i,1,n) rank[sa[i]] = i;
		for (int i = 0, j; i < n - 1; lcp[rank[i++]] = k)
			for (k && k--, j = sa[rank[i] - 1];
					s[i + k] == s[j + k]; k++);
	}
};

const int MAXN = 3e4 + 7 ;
const int LOG = 18 ;

int rmq[ 2 ][ LOG ][ MAXN ] ;
int at_pos[ 2 ][ MAXN ] ;
int pwid[ MAXN ] ;
ll pref[ MAXN ] , suff[ MAXN ] ;



int get_lcp ( int id , int l , int r ) {
    l = at_pos[ id ][ l ] , r = at_pos[ id ][ r ] ;
    if ( l > r ) { swap ( l , r ) ; }
    ++ l ;
    int wh = pwid[ r - l + 1 ] ;
    return min ( rmq[ id ][ wh ][ l ] , rmq[ id ][ wh ][ r - ( 1 << wh ) + 1 ] ) ;
}

void solve ( ) {
    string a ;
    cin >> a ;
    int n = a.size ( ) ;
    string hh = a ;
    reverse ( hh.begin ( ) , hh.end ( ) ) ;
    SuffixArray fw = SuffixArray ( a ) , bw = SuffixArray ( hh ) ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        at_pos[ 0 ][ fw.sa[ i ] + 1 ] = i ;
        at_pos[ 1 ][ bw.sa[ i ] + 1 ] = i ;
        rmq[ 0 ][ 0 ][ i ] = fw.lcp[ i ] ;
        rmq[ 1 ][ 0 ][ i ] = bw.lcp[ i ] ;
    }
    for ( int wh = 0 ; wh < 2 ; ++ wh ) {
        for ( int lvl = 1 ; lvl < LOG ; ++ lvl ) {
            for ( int i = 1 ; i + ( 1 << lvl ) - 1 <= n ; ++ i ) {
                rmq[ wh ][ lvl ][ i ] = min ( rmq[ wh ][ lvl - 1 ][ i ] , rmq[ wh ][ lvl - 1 ][ i + ( 1 << ( lvl - 1 ) ) ] ) ;
            }
        }
    }
    for ( int i = 0 ; i <= n + 1 ; ++ i ) {
        pref[ i ] = suff[ i ] = 0 ; 
    }
    for ( int len = 1 ; len <= n / 2 ; ++ len ) {
        for ( int l = 1 ; l + len <= n ; l += len ) {
            int r = l + len ;
            int extr = min ( len - 1 , get_lcp ( 0 , l , r ) - 1 ) ;
            int extl = min ( len , get_lcp ( 1 , n - l + 1 , n - r + 1 ) ) ;
            if ( extl + extr >= len ) {
                int cm = extl + extr - len ;
                int midl = r - extl , midr = l + extr ;
                ++ pref[ midl + len ] , -- pref[ midr + len + 1 ] ;
                ++ suff[ midl - len + 1 ] , -- suff[ midr - len + 1 + 1 ] ;
            }
        }
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        pref[ i ] += pref[ i - 1 ] ;
        suff[ i ] += suff[ i - 1 ] ;
    }
    ll ans = 0 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        ans += 1LL * pref[ i ] * suff[ i + 1 ] ;
    }
    cout << ans << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    for ( int i = 1 ; i < MAXN ; ++ i ) {
        pwid[ i ] = pwid[ i - 1 ] ;
        while ( 2 * ( 1 << pwid[ i ] ) < i ) { ++ pwid[ i ] ; }
    }
    int t = 1 ; cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}