void dfs(int a){
	used[a]=1;
	for (int i=0;i<N2;i++)A[a][i]=0;
	A[a][a>>5]|=(1<<(a&31));
	for (edge *p=E[a];p;p=p->next){
		if (!used[p->e])dfs(p->e);
		for (int i=0;i<N2;i++)
			A[a][i]|=A[p->e][i];
	}
}

	for (int i=0;i<N;i++)if (!used[i])
		dfs(i);
	popcount[0]=0;
	for (int i=1;i<65536;i++)popcount[i]=popcount[i>>1]+(i&1);
	int ret=N*(N-1)/2+N;
	for (int i=0;i<N;i++)
		for (int j=0;j<N2;j++){
			ret-=popcount[A[i][j]&65535];
			ret-=popcount[(A[i][j]>>16)&65535];
		}
	printf("%d\n",ret);