public static void main(String[] args) {
		int run = 13;
		boolean roll = true;
		long rollingProduct = 0;
		long largestProduct = 0;
		int largestProductIndex = 0;
		String numbers = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450";
		char[] numbersAsCharArray = numbers.toCharArray();
		int[] numbersAsIntArray = new int[numbersAsCharArray.length];
		//convert to ints
		for (int i = 0; i < numbersAsCharArray.length; i++) {
			numbersAsIntArray[i] = Integer.parseInt("" + numbersAsCharArray[i]);
			loopCounter++;
		}
		//calculate answer
		for (int i = 0; i < numbersAsIntArray.length - run; i++) {
			if(roll) {
				rollingProduct = calculateRunProd(i, run, numbersAsIntArray);
				if(rollingProduct == 0) {
					i = i + (run - 1);
					continue;
				}
				i = i + (run - 1);
				roll = false;
				continue;
			}
			//watch out for incoming zeroes
			if(numbersAsIntArray[i + (run - 1)] == 0) {
				roll = true;
				rollingProduct = 0;
				continue;
			}
			if(numbersAsIntArray[i] == 0) {
				roll = true;
				rollingProduct = 0;
				i++;
				continue;
			}
			rollingProduct = rollingProduct * numbersAsIntArray[i] / numbersAsIntArray[i - run];
			if (rollingProduct > largestProduct) {
				largestProduct = rollingProduct;
				largestProductIndex = i;
				System.out.println("Largest current product tail is at " + i + " with numbers multiplying to: " + largestProduct);
			}
			loopCounter++;
		}
		
		//answers and stats
		System.out.println("Numbers in set (in reverse): ");
		for (int i = largestProductIndex; i > largestProductIndex - run; i--) {
			System.out.print(numbersAsIntArray[i] + ", ");
		}
		System.out.println("Total loops: " + loopCounter);
	}