#include "skup.h"
#include "message.h"
#undef PutInt
#undef PutLL
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#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 RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define M_PI 3.14159265358979323846
template<class C> void mini(C& _a4, C _b4) { _a4 = min(_a4, _b4); }
template<class C> void maxi(C& _a4, C _b4) { _a4 = max(_a4, _b4); }

template<class TH> void _dbg(const char *sdbg, TH h) { cerr << sdbg << '=' << h << endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
	while (*sdbg != ',')cerr << *sdbg++; cerr << '=' << h << ','; _dbg(sdbg + 1, a...);
}

template<class T> ostream& operator<<(ostream& os, vector<T> V) {
	os << "["; for (auto& vv : V) os << vv << ","; os << "]";
	return os;
}

template<class T> ostream& operator<<(ostream& os, set<T> V) {
	os << "["; for (auto& vv : V) os << vv << ","; os << "]";
	return os;
}

template<class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) {
	return os << "(" << P.st << "," << P.nd << ")";
}


//#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
//#else
//#define debug(...) (__VA_ARGS__)
//#endif
inline int top(int a, int b) {
	return (a + b - 1) / b;
}
int nodes = NumberOfNodes();
int myId = MyNodeId();
int companies = NumberOfCompanies();
VI myCompanies;

const int chunk = 15000;
const int big = nodes * 1001 + 20;
void _sendVector(VI dupcia, int dest) {
	assert(SZ(dupcia) == big);
	int sz = SZ(dupcia);

	for (int i = 0; i < sz; i += chunk) {
		for (int j = i; j < i + chunk && j < sz; j++) {
			PutInt(dest, dupcia[j]);
		}
		Send(dest);
	}
}

VI _receiveVector(int src, int sz) {
	assert(sz == big);
	VI res;
	for (int i = 0; i < sz; i += chunk) {
		Receive(src);
		for (int j = i; j < i + chunk && j < sz; j++) {
			res.push_back(GetInt(src));
		}
	}
	return res;
}

void sendVector(VI dupcia, int dest) {
	VI myVector;
	myVector.push_back(SZ(dupcia));
	myVector.insert(myVector.end(), ALL(dupcia));
	myVector.resize(big);
	_sendVector(myVector, dest);
}

VI receiveVector(int src) {
	VI res = _receiveVector(src, big);
	int idx = 0;
	VI dupsko;
	bool found = false;
	int sz = INT_MAX;
	for (int i = 0; i < sz; i += chunk) {
		if (!found) {
			found = true;
			sz = res[idx++];
		}
		for (int j = i; j < i + chunk && j < sz; j++) {
			dupsko.push_back(res[idx++]);
		}
	}
	return dupsko;
}

unordered_map<int, int> dupsko;

struct companyInfo {
	int country;
	VI prices;
	void addToBuffer(VI & acc) {
		acc.push_back(SZ(prices));
		REP(i, SZ(prices)) {
			acc.push_back(prices[i]);
		}
		acc.push_back(country);
	}

	companyInfo() {
		country = myId;
		prices = myCompanies;
	}

	companyInfo(VI & acc, int & idx) {
		prices.resize(acc[idx++]);
		REP(i, SZ(prices)) {
			prices[i] = acc[idx++];
		}
		country = acc[idx++];
	}

	bool valid() {
		return !prices.empty();
	}

	bool operator<(const companyInfo & rhs) const {
		return country < rhs.country;
	}
};

struct info1 {
	set<companyInfo> sentInfo;
	set<companyInfo> notSent;
	int gotAll;
	info1() {
		notSent.insert(companyInfo());
		gotAll = 0;
	}
	void broadcastInfo() {
		VI message;
		message.push_back(SZ(notSent));
		for (companyInfo a : notSent) {
			a.addToBuffer(message);
			sentInfo.insert(a);
		}
		notSent.clear();
		if (sentInfo.size() == nodes) {
			gotAll |= 1 << myId;
		}
		message.push_back(gotAll);
		REP(i, nodes) {
			if (i == myId)
				continue;
			sendVector(message, i);
		}
	}

	void broadcastInfo2() {
		REP(i, nodes) {
			if (i == myId) {
				continue;
			}
			PutInt(i, gotAll);
			Send(i);
		}
	}

	void receiveInfo2() {
		REP(i, nodes) {
			if (i == myId) {
				continue;
			}
			Receive(i);
			gotAll |= GetInt(i);
		}
	}

	void receiveInfo() {
		REP(i, nodes) {
			if (i == myId)
				continue;
			VI acc = receiveVector(i);
			if (acc.empty()) {
				continue;
			}
			int idx = 0;
			int sz = acc[idx++];
			REP(j, sz) {
				companyInfo a(acc, idx);
				if (!sentInfo.count(a)) {
					notSent.insert(a);
				}
			}
			gotAll |= acc[idx++];
		}
	}

	LL getResult() {
		vector<int> acc;
		for (companyInfo c : sentInfo) {
			acc.insert(acc.end(), ALL(c.prices));
		}
		sort(ALL(acc), greater<int>());
		LL res = 0;
		REP(i, SZ(acc)) {
			res += (LL)(i + 1) * acc[i];
		}
		return res;
	}

	void printResult() {
		if (SZ(sentInfo) != nodes)
			return;
		REP(i, nodes) {
			if (gotAll & (1 << i)) {
				if (i == myId) {
					cout << getResult() << "\n";
				}
				return;
			}
		}
	}
};

int32_t main(int32_t argc, char ** argv) {
	ios_base::sync_with_stdio(0);
	myCompanies.resize(companies);
	REP(i, companies) {
		myCompanies[i] = GetShareCost(i);
	}
	info1 myInfo;
	REP(i, nodes) {
		myInfo.broadcastInfo();
		myInfo.receiveInfo();
	}
	REP(j, nodes) {
		myInfo.broadcastInfo2();
		myInfo.receiveInfo2();
	}
	myInfo.printResult();
	return 0;
}