qwq

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1000010,F=1<<10;
ll n,d[F],ans;
int main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++){
		int x,tmp=0;
		cin>>x;
		while(x){
			tmp|=1<<x%10;
			x/=10;
		}
		++d[tmp];
	}
	for(int i=1;i<F;++i){
		ans+=d[i]*(d[i]-1)/2;
		for(int j=i+1;j<F;++j){
			if(i&j) ans+=d[i]*d[j];
		}
	}
	cout<<ans;
	return 0;
}