#include <iostream>
#include <vector>
using namespace std;
const int all = (1 << 26) - 1;
int n, c, t, ans = 0;
string str;
vector<int> arr;
void Search(int cur, int visited) {
if (cur + 1 == n) {
if (visited == all) ans++;
return;
}
else {
Search(cur+1, visited | arr[cur+1]);
Search(cur+1, visited);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str;
c = 0;
for (const auto& s : str)
c |= 1 << (s - 'a');
arr.push_back(c);
}
Search(-1, 0);
cout << ans;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmNvbnN0IGludCBhbGwgPSAoMSA8PCAyNikgLSAxOwoKaW50IG4sIGMsIHQsIGFucyA9IDA7CnN0cmluZyBzdHI7CnZlY3RvcjxpbnQ+IGFycjsKCnZvaWQgU2VhcmNoKGludCBjdXIsIGludCB2aXNpdGVkKSB7CiAgICBpZiAoY3VyICsgMSA9PSBuKSB7CiAgICAgICAgaWYgKHZpc2l0ZWQgPT0gYWxsKSBhbnMrKzsKICAgICAgICByZXR1cm47CiAgICB9CiAgICBlbHNlIHsKICAgICAgICBTZWFyY2goY3VyKzEsIHZpc2l0ZWQgfCBhcnJbY3VyKzFdKTsKICAgICAgICBTZWFyY2goY3VyKzEsIHZpc2l0ZWQpOwogICAgfQp9CgppbnQgbWFpbigpIHsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luLnRpZShOVUxMKTsKICAgIAogICAgY2luID4+IG47CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIGNpbiA+PiBzdHI7CiAgICAgICAgYyA9IDA7CiAgICAgICAgCiAgICAgICAgZm9yIChjb25zdCBhdXRvJiBzIDogc3RyKQogICAgICAgICAgICBjIHw9IDEgPDwgKHMgLSAnYScpOwogICAgICAgIAogICAgICAgIGFyci5wdXNoX2JhY2soYyk7CiAgICB9CiAgICAKICAgIFNlYXJjaCgtMSwgMCk7CiAgICAKICAgIGNvdXQgPDwgYW5zOwogICAgCiAgICByZXR1cm4gMDsKfQ==