/* 
* Author: Justin Ryan L. Ayubo 
* Solution for: PA #1 
* Algorithm: 
* Details of algo goes here 
* Date of Submission: August 21, 2014 
* Honor Code: 
* I certify that I did not give or receive any aid in this activity and
* that I fully understand the consequences of violating such as 
* stipulated in the University Student Handbook 
*/
 
#include <iostream>
 
using namespace std;
 
int main(){
   //since 1 is not a prime number
   int x=2, y=1;
 
   while(x <= 1000000)
    {
     while(y <=1000000)
       {
        if(x%y == 0)
        {
        cout << x << endl;
        y++;
        }
        else
        y++;
       }
      ++x;
    }
 
   return 0;
}

LyogCiogQXV0aG9yOiBKdXN0aW4gUnlhbiBMLiBBeXVibyAKKiBTb2x1dGlvbiBmb3I6IFBBICMxIAoqIEFsZ29yaXRobTogCiogRGV0YWlscyBvZiBhbGdvIGdvZXMgaGVyZSAKKiBEYXRlIG9mIFN1Ym1pc3Npb246IEF1Z3VzdCAyMSwgMjAxNCAKKiBIb25vciBDb2RlOiAKKiBJIGNlcnRpZnkgdGhhdCBJIGRpZCBub3QgZ2l2ZSBvciByZWNlaXZlIGFueSBhaWQgaW4gdGhpcyBhY3Rpdml0eSBhbmQKKiB0aGF0IEkgZnVsbHkgdW5kZXJzdGFuZCB0aGUgY29uc2VxdWVuY2VzIG9mIHZpb2xhdGluZyBzdWNoIGFzIAoqIHN0aXB1bGF0ZWQgaW4gdGhlIFVuaXZlcnNpdHkgU3R1ZGVudCBIYW5kYm9vayAKKi8KCiNpbmNsdWRlIDxpb3N0cmVhbT4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpewogICAvL3NpbmNlIDEgaXMgbm90IGEgcHJpbWUgbnVtYmVyCiAgIGludCB4PTIsIHk9MTsKCiAgIHdoaWxlKHggPD0gMTAwMDAwMCkKICAgIHsKICAgICB3aGlsZSh5IDw9MTAwMDAwMCkKICAgICAgIHsKICAgICAgICBpZih4JXkgPT0gMCkKICAgICAgICB7CiAgICAgICAgY291dCA8PCB4IDw8IGVuZGw7CiAgICAgICAgeSsrOwogICAgICAgIH0KICAgICAgICBlbHNlCiAgICAgICAgeSsrOwogICAgICAgfQogICAgICArK3g7CiAgICB9CiAgICAgCiAgIHJldHVybiAwOwp9