#include <iostream>
#include <vector>
#include <utility>
#include <set>
#include <algorithm>

using namespace std;

int main() {
	set<vector<pair<int,int>>> S;
	int n;
	cin >> n;
	for(int i = 0; i < n; i++) {
		int m, x, y;
		cin >> m;
		std::vector<pair<int,int>> cc = std::vector<pair<int,int>>(m);
		for(int j = 0; j < m; j++) {
			cin >> x >> y;
			cc[j] = {x,y};
		}
		sort(cc.begin(), cc.end());
		int xx = cc[0].first;
		int yy = cc[0].second;
		for(int j = 0; j < m; j++) {
			cc[j].first -= xx;
			cc[j].second -= yy;
		}
		S.insert(cc);
	}
	std::cout << S.size() << std::endl;
}