program q;
const n=10;
type Myarray=array[1..n]of longint;
var a:myarray;
k,l:longint;
procedure init(var x:myarray);
function Nod(a,b:longint):longint;
begin

if (a=0) or (b=0) then nod :=a+b
else if a>b then nod:=nod(a-b,b) else nod:=nod(a,b-a);
end;
Procedure Solve(x:myarray;var p,q:longint);
var i,j,z:longint;
begin
z:=1;
for i:=1 to n-1 do
for j:=i+1 to n do
if nod(x[i],x[j])>z then begin
z:=nod(x[i],x[j]);
p:=x[i];q:=x[j];
end;
end;
begin
init(a);
solve(a,l,k);
writeln('Максимальное НОД у чисел',k,'и',l);
end.