听灌佬多

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 212370440130137957ll, MOD =99593441 , base = 131, base1 = 13331;
int n;
string s;

struct ha {
	int hash1, hash2;
} z[12345678];

bool cmp(ha x, ha y) {
	return x.hash1 < y.hash1;
}

int hhash(string x) {//函数名不能直接用hash，会重名;
	int cnt = 0;
	for (int i = 0; i < x.length(); i++) {
		cnt = (cnt * base1 + x[i]) % mod;
	}
	return cnt;
}

int Hash(string x) {
	int cnt = 0;
	for (int i = 0; i < x.length(); i++) {
		cnt = (cnt * base + x[i]) % MOD;
	}
	return cnt;
}

signed main(/*yzx 2024.10.4   洛谷P3370【模板】字符串哈希*/) {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> s;
		z[i].hash1 = hhash(s);
		z[i].hash2 = Hash(s);
	}
	int ans = 0;
	sort(z + 1, z + n + 1, cmp);
	for (int i = 2; i <= n; i++) {
		if (z[i].hash1 != z[i - 1].hash1 || z[i - 1].hash2 != z[i].hash2) {
			ans++;
		}
	}
	cout << ans << endl;
	return 0;
}