public Problem125(){
		for(int i = 0; i < n2; i++){
			s[i] = i*i;
		}
		ArrayList<Integer> a = new ArrayList<Integer>();
		for(int i = 1; i < n2; i++){
			int sum = s[i];
			for(int j = i+1; j < n2; j++){
				sum += s[j];
				if(sum > n){
					break;
				}
				if(Palindrome(sum)){
					if(!a.contains(sum)){
						a.add(sum);
					}
					System.out.println(sum);
				}
			}
		}
		long sum = 0;
		for(Integer i : a){
			sum += i;
		}
		System.out.println(sum);//wrong: 2916867073
	}