#include<bits/stdc++.h>
//#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a);i < (long long)(b);i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define pb push_back
#define fr first
#define sc second
#define ALL(x) (x).begin(),(x).end()
#define mp make_pair
#define dou double
//#define mod 998244353
//using mint = static_modint<998244353>;
int main(){
  ll n;
  cin>>n;
  vector<string> s(n);
  rep(i,n) cin>>s[i];
  map<string,ll> a;
  ll ans=0;
  rep(i,n) repi(j,i+1,n){
    string t="",u="";
    t+=s[i];
    t+=s[j];
    u+=s[j];
    u+=s[i];
    if(a[t]==0){
      ans++;
      a[t]++;
    }
    if(a[u]==0){
      ans++;
      a[u]++;
    }
  }
  cout<<ans<<endl;
}