public Problem123(){
		double limit = Math.pow(10,10);
		int limit2 = 1000000;
		int[] p = MyLib.generatePrimes(limit2);
		for(int i = 0; i < limit2; i++){
			long n = i+1;
			long pn = p[i];
			long mod = pn*pn;
			long a = MyLib.powerMod(pn-1, n, mod);
			long b = MyLib.powerMod(pn+1, n, mod);
			long r = (a + b) % mod;
			if(r > limit){
				System.out.println(n + " " + pn + " " + mod + " " + a + " " + b + " " + r);
				break;
			}
		}
	}