#include <iostream>
using namespace std ;
int m , n , t,rem, num;
int main(){
cout << "Enter the natural number "<< '\n' ;
cin >> m ;
if (m==1 || m==2) {
cout << m << "is prime" << '\n' ;
//if cin is 1 or 2 it immediately tells me that they are prime.
}else{
for (int i=3; i<m; i++) {
for (n=2; n<i ; n++) {
rem=i%n ;
// for i<m the function checks the remainder of i when divided by numbers less than i.
if (rem == 0) {
break;
}else{
num=i ;
}
//If there is a remainder which is equal to 0 then the loop stops and goes further to check for another 'i'.
}
cout << num ;
}
}
return 0 ;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkIDsKaW50IG0gLCBuICwgdCxyZW0sIG51bTsKaW50IG1haW4oKXsKY291dCA8PCAiRW50ZXIgdGhlIG5hdHVyYWwgbnVtYmVyICI8PCAnXG4nIDsKY2luID4+IG0gOwogICAgaWYgKG09PTEgfHwgbT09MikgewogICAgICAgIGNvdXQgPDwgbSA8PCAiaXMgcHJpbWUiIDw8ICdcbicgOwogICAgICAgIC8vaWYgY2luIGlzIDEgb3IgMiBpdCBpbW1lZGlhdGVseSB0ZWxscyBtZSB0aGF0IHRoZXkgYXJlIHByaW1lLgogICAgICAgIAogICAgfWVsc2V7CiAgICBmb3IgKGludCBpPTM7IGk8bTsgaSsrKSB7CiAgICAgICAgZm9yIChuPTI7IG48aSA7IG4rKykgewogICAgICAgICAgICAgICAgcmVtPWklbiA7CiAgICAgICAgICAgIC8vIGZvciBpPG0gdGhlIGZ1bmN0aW9uIGNoZWNrcyB0aGUgcmVtYWluZGVyIG9mIGkgd2hlbiBkaXZpZGVkIGJ5IG51bWJlcnMgbGVzcyB0aGFuIGkuCiAgICAgICAgICAgIGlmIChyZW0gPT0gMCkgewogICAgICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgICAgIH1lbHNlewogICAgICAgICAgICAgICAgIG51bT1pIDsKICAgICAgICAgICAgfQogICAgICAgICAgICAvL0lmIHRoZXJlIGlzIGEgcmVtYWluZGVyIHdoaWNoIGlzIGVxdWFsIHRvIDAgdGhlbiB0aGUgbG9vcCBzdG9wcyBhbmQgZ29lcyBmdXJ0aGVyIHRvIGNoZWNrIGZvciBhbm90aGVyICdpJy4KICAgICAgICAgICAgfQogICAgICAgIGNvdXQgPDwgbnVtIDsKICAgICAgICAKICAKICAgICAgICB9CiAgICAgICAKICAgIH0KICAgIAogICAgICAgIHJldHVybiAwIDsKfQ==