Pascal :

var n,j,i,x,k:longint;
 m:longint;

 begin
 readln(k);
 for n:=2 to k do
   begin
   m:=0;
  for i:=2 to trunc(n/2) do
    begin
    if (n mod i =0) and (n<>1) then
     m:=m+i;
     end;
    if m+1=n then writeln(n);
 end;
  end.

Java :

import java.util.Scanner;

class  Main
{
	public static void main(String[] args) 
	{
        Scanner in =new Scanner(System.in);

		int a=in.nextInt();

		wanshu(a);

	}
	
    public static void wanshu(int a)
	{
		int Sum=0;
		for(int b=2;b<=a;b++)
		{
			int sum=0;
			for(int i=1;i<=b/2;i++)
			{
				if(b%i==0)
					sum=sum+i;
			}
			if(sum==b)
			{
				System.out.println(b);
				Sum++;
			}
		}

		if(Sum==0)
			System.out.println("No");
			
	}



}