// #pragma comment(linker, "/stack:247474112")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") 
// #pragma GCC optimize("unroll-loops")
 
#include <bits/stdc++.h>
using namespace std; 
  
#define     pii             pair<int ,int>
#define     ff              first
#define     ss              second
#define     pb(x)           push_back(x)
#define     mp              make_pair
#define     sz(x)           x.size()
#define     clr(x)          x.clear()
#define     mem(x ,y)       memset(x , y , sizeof x )
#define     all(a )         a.begin() , a.end()
#define     endl            "\n"
#define     si(x )          scanf("%d", &x)
#define     sl(x )          scanf("%I64d", &x)
#define     sd(x )          scanf("%lf", &x)
#define     sii(x,y )       scanf("%d%d", &x,&y)
#define     siii(x,y ,z)    scanf("%d%d%d ", &x,&y , &z)
#define     rep(i ,n )      for(int i = 0 ; i < n ; i++ )
#define     repi(i ,n )     for(int i = 1 ; i <= n ; i++ )
#define     forn(i ,x,n )   for(int i = x ; i <= n ; i++ )
#define     ford(i ,x,n )   for(int i = x ; i >= n ; i-- )
#define     repit(i, c)     for( __typeof((c).begin()) i = (c).begin(); i != (c).end();++i )
#define     dbg(args...)    do {   cerr << #args << ' ' ;  print(args); } while(0); cerr<< endl ;
  
typedef long long ll  ;
typedef unsigned long long  ull ;
typedef vector<int> vi  ;
 
const ll  mod =  (ll)1e9+7;
const int    inf = 1e9+7  ;
const long long  infL = 1e18 ;
 
int setbit(int n, int pos  ) { return n = n|(1<< pos) ; }
int resetbit(int n,int pos ) {  return n =  n & ~(1<<pos ); }
bool checkbit(int  n,int pos ) { return (bool ) (n&(1<<pos))  ; }
 
template < typename T > T mul(T x, T y   ) { x %= mod ; y %= mod ; return (x*y)%mod  ;  }
template < typename T > T add(T x, T y  ) { x %= mod ; y %= mod ; return (x+y)%mod ;  }
template < typename T > T modPow(T x, T k ,T mod ) { if(k == 0 ) return 1; if(k&1  ) { return ( (x%mod)*modPow(x,k-1, mod )%mod )%mod ; } else { T ret = modPow(x,k/2 , mod ) ; ret %= mod ; return (ret*ret )%mod; } }
template < typename T > T ext_gcd(T num1 , T num2, T &X , T &Y ) { T r2,r1, q2, q1 , x2, x1, y2 ,y1 , x,  y, r   ; x2 = 1; y2 = 0;  x1 = 0; y1 = 1; for( r2 =num1 ,r1 = num2 ;r1 != 0 ; y2 = y1, y1 = y,x2 = x1 ,x1 = x ,r2 = r1, r1 = r) {q1 = r2/r1; x = x2 - q1*x1; y = y2 - q1*y1; r = r2%r1 ; } X = x2 ; Y = y2 ; return r2 ;  }
template < typename T > void print(const T& v) {    cerr << v << ' ' ;}
template < typename T1, typename... T2 > void print( const T1& first, const T2&... rest ){ print(first); print(rest...) ;}
 
template < typename T > 
T  modInv( T x , T m = 1e9+7) {  
    return modPow(x,m-2 , m) ;   
    // long long ret, t ;// 
    // ext_gcd( x, m ,ret ,t  ) ;
    // ret %= m ; if(ret<0) ret += m  ; 
    // return ret;
} 
 
// debuging ...
template<typename T > 
void dbg_a(T a[] ,int n=10 ) {
    cerr << "[ "; rep(i,n )cerr<<a[i]<<' ' ; cerr<< " ]" <<  endl; 
}
 
template < typename F,  typename S >
ostream& operator << ( ostream& os, const pair< F, S > & p ) {
    return os << "[ " << p.first << ", " << p.second << " ]";
}
 
template < typename T >
ostream &operator << ( ostream & os, const vector< T > &v ) {
    os << "[ "; rep(i , sz( v)  )  os << v[i] << ' ' ; return os << " ]" ; 
}

template < typename T >
ostream &operator << ( ostream & os, const set< T > &s ) {
    os << "[ "; repit(it ,s  )  os << *it  << ' ' ; return os << " ]" ; 
}

template < typename T >
ostream &operator << ( ostream & os, const multiset< T > &s ) {
    os << "[ "; repit(it ,s  )  os << *it  << ' ' ; return os << " ]" ; 
}


//int dx[] = {0 , 0 ,+1, -1 } ;
//int dy[] = {-1, +1,0 , 0 };


ll modAdd(ll &x ,ll  y) {
    x += y ;
    if(x>= mod ) x-=mod; 
    return x ;
}
const int M = (int )2e6 +33;  
const int nx  = 1000+23  ;
 
 
////  code from here ...  

ll a[M + 2]  , n , f1[100] , f0[100 ];
ll dp[72][(1<<19)+123] ; 
int mask[100 ] ; 
ll cnt[100 ]  ,lim   ; 
vector<int> prime , v ;

ll func( int id, int msk ) {
    if( id>= lim ) {
        if(msk==0 ) return 1LL ; 
        return  0; 
    }
    ll &ans  = dp[id][msk ] ;
    if(ans!=-1) return ans ;

    ans = func(id+1,msk ) ; 
    // pick odd 

    ans = add(ans, func(id+ 1, msk^mask[id]  )*f1[id] ) ;
    ans = add(ans, func(id+ 1, msk^mask[id]  )*f0[id] ) ;


    return ans  ;



}

void seive ( ) {
    for(int i=2;i <100; i+=2 )
        if( a[i]==0) 
            for(int j= i+i ; j<=100; j+= i)
                a[j]=1 ; 
    forn(i, 2, 100) if(a[i]==0)
        prime.pb(i ) ; 
    cout <<prime ;
    cout << "----------------" <<  endl ; 
} 

void createMask(int id ,int x )  {
    
    rep(i ,sz(prime) ) {
        int c= 0  ;
        while( x%prime[i] == 0 ) {
            c++ ;
            x/= prime[i] ; 
        }

        if(c  > 0 ){
            if(c&1 )
                mask[id ] = setbit(mask[id] , i)  ;
        } 

    }
    cout<< a[id] << ' ' ; 
    ford(i,5 , 0)  cout << checkbit(mask[id], i )  ;  
    cout << endl ; 
} 

void solve() {
    ll   q , r  ,k ;
    mem(dp,-1) ; 
    cin >>n  ; 
    rep(i,n ) {

        cin>> a[i]  ; 
        if(cnt[a[i] ] == 0 ) v.pb(a[i ]) ;
        cnt[a[i] ]++ ;

    } 
    lim = sz(v );
    rep(i , sz(v)   ) {
        int x =v[i] ;
        if(cnt[x]&1 ) {
            f1[i] = modPow(2LL, cnt[x], mod) -1  ;
            f0[i] = modPow(2LL, cnt[x]-1, mod) -1  ;

        }  else{

            f1[i] = modPow(2LL, cnt[x]-1, mod) -1  ;
            f0[i] = modPow(2LL, cnt[x], mod) -1  ;

        }  


    } 
    rep(i, sz(v) ) createMask(i ,v[i] ) ; 

    dbg_a(mask ) ;
    dbg_a(f0) ; 
    dbg_a(f1) ; 




    cout << func(0,  0 )  << endl ; 

}           

map<string,ll > ma;
ll ncr(ll x ){
    return (x*(x-1))/2LL ; 
}
int main() {
   
   // ios::sync_with_stdio(false);  cin.tie(0); cout.tie(0) ;  
    int t=1 , c= 0 ;  
   //  seive() ; 
    //cin >> t; 
    cin >> n ;
    rep(i,n ) {
        string s ; cin>> s; 
        sort(all( s) );  
        ma[s]++ ; 

    } 
    ll ans= 0; 
    repit(it, ma) {
        ans += ncr((*it).ss ) ; 

    }
    cout << ans ;

    
    while(t--) {
        // printf("Case %d: ",++c ) ; 
    //    solve() ; 
    
    }   
    return 0 ;
 
}










Measured memory_bytes: 13184