#include <iostream>

#include <algorithm>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <vector>

#include <cstdlib>

#include <map>

#define LL long long

#define N 1000010

using namespace std;

const int HASH=;

const int MAXN=;

struct HASHMAP

{

    int head[HASH],next[MAXN],size;

    unsigned long long state[MAXN];

    int f[MAXN];

    void init()

    {

        size=;

        memset(head,-,sizeof(head));

    }

    int insert(unsigned long long val)

    {

        int h=val%HASH;

        for(int i=head[h];~i;i=next[i])

        {

            if(val==state[i])

            {

                return ;

            }

        }

        state[size]=val;

        next[size]=head[h];

        head[h]=size++;

        return ;

    }

}H;

const int SEED=;

unsigned long long p[MAXN];

unsigned long long s[MAXN];

char str[MAXN];

int main()

{

    p[]=;

    for(int i=;i<MAXN;i++)p[i]=p[i-]*SEED;

    int T;

    scanf("%d",&T);

    while(T--)

    {

        scanf("%s",str);

        int n=strlen(str);

        s[]=;

        for(int i=;i<=n;i++)

        {

            s[i]=s[i-]*SEED+str[i-];

        }

        int ans=;

        for(int L=;L<=n;L++)

        {

            H.init();

            for(int i=;i+L-<=n;i++)

            {

                int res=H.insert(s[i+L-]-s[i-]*p[L]);

                ans+=res;

            }

        }

        printf("%d\n",ans);

    }

}