#!/usr/bin/perl

# Find least prime factor of n

$n=int(<STDIN>);
while($n>1){
$p=2;
$hit=0;
while($p*$p<=$n && $hit == 0){if($n%$p == 0){$hit=1;} else {$p=$p+1;}}
if($hit==0){print "The number $n is prime.\n";}
if($hit==1){print "The least prime factor of $n is $p.\n";}
$n=int(<STDIN>);
}