var a,b,c,i,j:integer;
begin
readln(a,b);
if a begin
c:=a;
a:=b;
b:=c;
end;
repeat
c:=a mod b;
if c=0
then
begin
if b<>1
then writeln('Not coprime')
else writeln('Coprime numbers');
break;
end;
a:=b;
b:=c;
until false;
writeln('The greatest common divisor is: ',b);
end.
