#include #define int long long using namespace std; const int N=4010; const int mod=1e9+7; int n; int ans; vector >v[3]; map,int>cnt[3]; bool operator < (paira,pairb){ return a.first*b.second>n; for(int i=1;i<=n;i++){ int d,x,y; cin>>d>>x>>y; int g=__gcd(x,y); x/=g;y/=g; v[d].push_back(make_pair(x,y)); cnt[d][make_pair(x,y)]++; } sort(v[0].begin(),v[0].end()); sort(v[1].begin(),v[1].end()); sort(v[2].begin(),v[2].end()); ans=1; ans+=(int)v[0].size(); ans+=(int)v[1].size(); ans+=(int)v[2].size(); ans+=(int)v[0].size()*(int)v[1].size(); ans+=(int)v[0].size()*(int)v[2].size(); ans+=(int)v[1].size()*(int)v[2].size(); ans+=(int)v[0].size()*(int)v[1].size()*(int)v[2].size(); //???? for(int i=0;i