public class Primes {
	public static void main(String[] args) {
		final int N = 1000000;
		final int sqrtN = (int)Math.sqrt(N);
		boolean[] composite = new boolean[N + 1];
		int[] primes = new int[78499]; // There are 78498 primes less than 1 million, which we will store in primes[1]...primes[78498]

		// Mark all the composite numbers from 1 to N
		for (int i = 2; i <= BLANK_0; i++) {
			if (!composite[i]) {
				for (int j = (int)Math.pow(i, BLANK_1); j <= N; j += BLANK_2) {
					composite[j] = true;
				} 
			}
		}

		// Fill the primes array with the prime numbers that are less than 1 million, 
		// starting with primes[1]=2
		//
		int n = 1;
		for (int i = 2; i <= N; i++) {
			if (!composite[i]) {
				primes[n] = BLANK_3;
				n++;
			}
		}
		
		// Display the indexed sequence of prime numbers that are less than 1 million
		//
		for (int i = 1; i < primes.length; i++) {
			System.out.println("primes[" + i + "] = " + primes[BLANK_4]);
		}
	}
}