public Problem95(){
		for(int i = 0; i <= n; i++){
			double s = Math.sqrt(i);
			a[i] = 1;
			for(int j = 2; j <= s; j++){
				if(i % j == 0){
					a[i] += j;
					if(j != s){
						a[i] += i/j;
					}
				}
			}
		}
		System.out.println("Done step one");
		
		int LongestChain = 0;
		int StartingPoint = 0;
		
		for(int i = 0; i <= n; i++){
			ArrayList<Integer> list = new ArrayList<Integer>();
			int current = i;
			int c = 0;
			while(!list.contains(current) && current <= n){
				c++;
				list.add(current);
				current = a[current];
			}
			if(c > LongestChain && current == i){
				LongestChain = c;
				StartingPoint = i;
				System.out.println(i + " " + c);
			}
		}
	}