class Slip26
{
public static void main(String a[])
{
int no[]=new int[a.length];
int i,k=0,l=0;
int pm[]=new int[a.length];
int pr[]=new int[a.length];
for(i=0;i
{
no[i]=Integer.parseInt(a[i]);
}
for(i=0;i
{
System.out.println(no[i]);
}
for(i=0;i
{
int j=2;
int flag=0;
while(j<=no[i]/2)
{
if(no[i]%j==0)
{
flag=1;
break;
}
j++;
}
if(flag==0)
{
pm[k]=no[i];
System.out.println("prime="+pm[k]+" ");
k++;
}
}
for(i=0;i
{
int j=1,sum=0;
while(j<=no[i]/2)
{
if(no[i]%j==0)
sum=sum+j;
j++;
}
if(no[i]==sum)
{
//int pr[]=new int[1];
pr[l]=no[i];
System.out.println("perfect="+pr[l]+" ");
l++;
}
}
l--;
k--;
System.out.println("prime numbers are");
for(i=0;i
{
if(pm[i]==0)
break;
else
System.out.println(pm[i]+" ");
}
System.out.println("perfect numbers are");
for(i=0;i
{
if(pr[i]==0)
break;
else
System.out.println(pr[i]+" ");
}
}
}