#include #include #include #include #include #include #include #include #include #include #include #include #include #pragma warning(disable:4996) typedef long long ll; #define MIN(a, b) ((a)>(b)? (b): (a)) #define MAX(a, b) ((a)<(b)? (b): (a)) #define LINF 9223300000000000000 #define INF 2140000000 const long long MOD = 1000000007; using namespace std; vector pp; void preparePrime( int maxp ) { int i; vector a(maxp+1); for(i=2; i<=maxp; i++) { int k=i+i; while(k<=maxp) { a[k]=1; k+=i; } } for(i=2; i<=maxp; i++) { if(a[i]==0) pp.push_back( i ); } return; } void decompositPrime( ll a, vector >& vv ) { //preparePrime( (int)sqrt((double)a)+1 ); int i; for(i=0; i<(int)pp.size(); i++) { int count = 0; while(a % pp[i] == 0 ) { a /= pp[i]; count ++; } if(count>0) vv.push_back( make_pair( pp[i], count ) ); if (a==1) break; } if(a>1) { vv.push_back( make_pair( a, 1 ) ); } return; } int s[100005][303]; int main(int argc, char* argv[]) { int n; scanf("%d", &n); preparePrime(2001); vector mp(2001,-1); int i; for(i=0; i<(int)pp.size(); i++) { mp[pp[i]]=i; } vector > vv; for(i=0; i