--------------------------------
Start Of Program
--------------------------------


This Python program generates the first N prime numbers using an algorithm named the Sieve of Eratosthenes.

--------------------------------

Entered value: N = 100

--------------------------------

A[0] := 2.

A[1] := 3.

A[2] := 5.

A[3] := 7.

A[4] := 11.

A[5] := 13.

A[6] := 17.

A[7] := 19.

A[8] := 23.

A[9] := 29.

A[10] := 31.

A[11] := 37.

A[12] := 41.

A[13] := 43.

A[14] := 47.

A[15] := 53.

A[16] := 59.

A[17] := 61.

A[18] := 67.

A[19] := 71.

A[20] := 73.

A[21] := 79.

A[22] := 83.

A[23] := 89.

A[24] := 97.

A[25] := 101.

A[26] := 103.

A[27] := 107.

A[28] := 109.

A[29] := 113.

A[30] := 127.

A[31] := 131.

A[32] := 137.

A[33] := 139.

A[34] := 149.

A[35] := 151.

A[36] := 157.

A[37] := 163.

A[38] := 167.

A[39] := 173.

A[40] := 179.

A[41] := 181.

A[42] := 191.

A[43] := 193.

A[44] := 197.

A[45] := 199.

A[46] := 211.

A[47] := 223.

A[48] := 227.

A[49] := 229.

A[50] := 233.

A[51] := 239.

A[52] := 241.

A[53] := 251.

A[54] := 257.

A[55] := 263.

A[56] := 269.

A[57] := 271.

A[58] := 277.

A[59] := 281.

A[60] := 283.

A[61] := 293.

A[62] := 307.

A[63] := 311.

A[64] := 313.

A[65] := 317.

A[66] := 331.

A[67] := 337.

A[68] := 347.

A[69] := 349.

A[70] := 353.

A[71] := 359.

A[72] := 367.

A[73] := 373.

A[74] := 379.

A[75] := 383.

A[76] := 389.

A[77] := 397.

A[78] := 401.

A[79] := 409.

A[80] := 419.

A[81] := 421.

A[82] := 431.

A[83] := 433.

A[84] := 439.

A[85] := 443.

A[86] := 449.

A[87] := 457.

A[88] := 461.

A[89] := 463.

A[90] := 467.

A[91] := 479.

A[92] := 487.

A[93] := 491.

A[94] := 499.

A[95] := 503.

A[96] := 509.

A[97] := 521.

A[98] := 523.

A[99] := 541.

--------------------------------
End Of Program
--------------------------------