#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<string>

 #include<algorithm>

 using namespace std;

 typedef long long ll;

 const int maxn = 1e6 + ;

 int Next[maxn];

 void getN(char *s1) {//求子串与自身匹配

     int i = , j, p, len = strlen(s1);

     Next[] = len;

     while (i +  < len&&s1[i] == s1[i + ])

         i++;

     Next[] = i;

     p = ;

     for (i = ; i < len; i++) {

         if (Next[i - p] + i < Next[p] + p)

             Next[i] = Next[i - p];

         else {

             j = Next[p] + p - i;

             if (j < )

                 j = ;

             while (i + j < len&&s1[j] == s1[i + j])

                 j++;

             Next[i] = j;

             p = i;

         }

     }

 }

 char s[maxn];

 int main() {

     int t;

     scanf("%d", &t);

     while (t--) {

         scanf("%s", s);

         int n = strlen(s);

         getN(s);

         long long ans = ;

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

             if (Next[i] == n - i) ans += n - i;

             else ans += Next[i] + ;

         }

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

     }

 }