1
#include <bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
const int N = 5e4 + 100;
5
ll ans;
6
int n;
7
vector<int> a[N];
8
map<vector<int>, int> cnt;
9

10
int main() {
11
    ios::sync_with_stdio(false);
12
    cin.tie(0);
13
    cout.tie(0);
14
    cin >> n;
15
    for (int i = 1; i <= n; i++) {
16
        for (int j = 1; j <= 5; j++) {
17
            int x;
18
            cin >> x;
19
            a[i].push_back(x);
20
        }
21
        sort(a[i].begin(), a[i].end());
22
    }
23
    ans = 1ll * (n - 1) * n / 2;
24
    for (int i = 1; i <= n; i++) {
25
        vector<int> vec;
26
        for (int k : a[i])
27
            vec.push_back(k);
28
        for (int st = 1; st <= (1 << 5) - 1; st++) {
29
            vector<int> now;
30
            for (int j = 0; j <= 4; j++) {
31
                if (st & (1 << j))
32
                    now.push_back(vec[j]);
33
            }
34
            ans += (now.size() % 2 ? -1 : 1) * cnt[now];
35
            cnt[now]++;
36
        }
37
    }
38
    cout << ans;
39
}