private void findLongestChain(){
		int biggest = 0;
		int realNum = 0;
		for (int i = 2; i <= 1000000; i++){
			long collatz = i;
			int chain = 1;
			while (collatz > 1){
				if(collatz%2==0){
					collatz = handleEven(collatz);
				} else {
					collatz = handleOdd(collatz);
				}
				chain++;
			}
			if(biggest <= chain){
				biggest = chain;
				realNum = i;
			}
		}
		System.out.println("Number with longest Collatz chain is: " + realNum);
	}