/*
エラトステネスの篩をjavascriptで書いてみた
http://ja.wikipedia.org/wiki/%E3%82%A8%E3%83%A9%E3%83%88%E3%82%B9%E3%83%86%E3%83%8D%E3%82%B9%E3%81%AE%E7%AF%A9
*/
function makePrime(max){
var numList = [];
var primeNumList = [];
for (var i=2; i<=max; i++){
numList[i-2]=i;
}
primeNumList[0]=numList[0];

for (var k=1;primeNumList[primeNumList.length -1]*primeNumList[primeNumList.length -1]<max;k++){
primeNumList[k-1]=numList[0];
var j=0;
var temp=[];
for (var i in numList){
if (numList[i]%primeNumList[k-1] != 0){
temp[j] = numList[i];
j++;
}
}
numList=temp;
}
return primeNumList.concat(numList);
}
writeln(makePrime(100));