function IsPrime(n: integer): integer;
begin
var k, i :integer
    For i:=2 to n div 2 do
     if n mod i = 0 then
     Begin
       k:=1;
       break;
     End;
    if k=0 then writeln('Sum is prime')
     else writeln('Sum is not prime');
    readln;
end;

Var i, :integer;
Var
  a: array[1..30] of integer;
  sum: integer;

begin
  for i := 1 to 30 do
  begin
    a[i] := random(0, 50);
    inc(sum, a[i]);
  end;
    IsPrime(sum);
end.