#include <bits/stdc++.h>

#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORD(i,a,b) for (int i = (a); i >= (b); i--)
#define REP(i,b) for (int i = 0; i < (b); i++)

using namespace std;

typedef long long ll;

ll bals[1005];
ll nbals[1005];

int main() {
	int n;
	while (scanf("%d", &n) == 1) {
		REP(i,n) scanf("%lld", &bals[i]);
		REP(i,n) {
			nbals[i] = 0;
			ll b = bals[i];
			while (b > 0) {
				int d = b % 10;
				b /= 10;
				nbals[i] |= (1 << d);
			}
		}
		sort(nbals, nbals + n);
		int ans = unique(nbals, nbals + n) - nbals;
		printf("%d\n", ans);
	}
	return 0;
}