private static void findTheBiggest() {
//		The first numbers of the Fibonacci sequence are 1 and 2
		BigInteger FirstInteger = BigInteger.valueOf(1);
		BigInteger SecondInteger = BigInteger.valueOf(2);
		BigInteger TemporaryInteger = BigInteger.valueOf(0);
		int i = 3;
//		Using compareTo to check if SecondInteger is numerically smaller than reallyBigInteger
		for (i = 3; SecondInteger.compareTo(reallyBigInteger) < 0; i++) {
			TemporaryInteger = FirstInteger.add(SecondInteger);
			FirstInteger = SecondInteger;
			SecondInteger = TemporaryInteger;
			
		}
		System.out.println(i);
	}