#include<iostream>
#include<set>
#include<string>
#include<algorithm>

using namespace std;

string str;

void read(){
  cin >> str;
}

void work(){
  set<string> S;
  
  for(int i=0;i<str.size();i++){
    string pre, suff;
    
    for(int j=0;j<=i;j++)
      pre += str[j];
    
    for(int j=i+1;j<str.size();j++)
      suff += str[j];

    S.insert(pre+suff);
    S.insert(suff+pre);
    
    reverse(pre.begin(),pre.end());

    S.insert(pre+suff);
    S.insert(suff+pre);

    reverse(pre.begin(),pre.end());
    reverse(suff.begin(),suff.end());
    
    S.insert(pre+suff);
    S.insert(suff+pre);
    
    reverse(pre.begin(),pre.end());

    S.insert(pre+suff);
    S.insert(suff+pre);
  }
  
  cout << S.size() << endl;
}

int main(){
  int cases;
  cin >> cases;

  for(int i=0;i<cases;i++){
    read();
    work();
  }
  
  return 0;
}