#include <stdio.h>
#include <math.h>
int primfaktor(int n)
{
int i;
if( n<1 )
return -2;
if( n==1 )
return -1;
if (n%2 == 0)
{
return 2;
}
for (i
= 3; i
<= sqrt(n
); i
= i
+2) {
if (n%i == 0)
{
return i;
}
}
return n;
}
int main()
{
int r, pf=65535;
while ((r = primfaktor (pf))> 1)
{
pf=pf/r;
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxtYXRoLmg+CiAKaW50IHByaW1mYWt0b3IoaW50IG4pCnsKICBpbnQgaTsKICAKICBpZiggbjwxICkKICAJcmV0dXJuIC0yOwogIAogIGlmKCBuPT0xICkKICAJcmV0dXJuIC0xOwogCiAgaWYgKG4lMiA9PSAwKQogIHsKICAgIHJldHVybiAyOwogIH0KIAogIGZvciAoaSA9IDM7IGkgPD0gc3FydChuKTsgaSA9IGkrMikKICB7CiAgICBpZiAobiVpID09IDApCiAgCXsKICAJCXJldHVybiBpOwogIAl9CiAgfQogIAogIHJldHVybiBuOwp9CgppbnQgbWFpbigpCnsKICBpbnQgciwgcGY9NjU1MzU7CiAKICB3aGlsZSAoKHIgPSBwcmltZmFrdG9yIChwZikpPiAxKQogIHsKICAJcHJpbnRmKCIlZFxuIixyKTsKICAJcGY9cGYvcjsKICB9CiAgcmV0dXJuIDA7Cn0KCg==