Program Mang;
Uses crt;
Var A: array[1..100000] of longint;
n, cnt, sum, i: longint;
Function is_Prime(a: longint): boolean;
Var i: longint;
Begin
If a < 2 then exit(false);
For i:=2 to trunc(sqrt(a)) do
If a mod i = 0 then exit(false);
exit(true);
End;
Function isHH(a: longint): boolean;
Var ans, i: longint;
Begin
ans := 0;
For i:=1 to a div 2 do
If a mod i = 0 then ans := ans + i;
If ans = a then exit(true);
exit(false);
End;
Begin
Clrscr;
Write('Nhap n: '); Readln(n);
cnt := 0;
sum := 0;
For i:=1 to n do
Begin
Write('A[',i,'] = ');
Readln(A[i]);
If is_Prime(A[i]) then inc(cnt);
If isHH(A[i]) then sum := sum + A[i];
End;
Writeln('Co ',cnt,' so nguyen to');
Write('Tong cac so hoan hao la ',sum);
Readln
End.