uses crt;
var i,n:longint;
function perfect(n:longint):boolean;
var i,sum:longint;
begin
sum:=0;
for i:=1 to trunc(sqrt(n)) do
begin
if(n mod i = 0) and (i * i <> n) then sum:=sum + i + (n div i);
if(n mod i = 0) and (i * i = n) then inc(sum, i);
end;
dec(sum, n);
//write(sum,' - ');
//if(sum = n) then write('YES') else write('NO');
exit(sum = n);
end;
begin
clrscr;
// n:=20;
// perfect(n);
for i:=1 to 1000 do
if(perfect(i)) then write(i,' ');
readln;
end.
