Program nod1;
const InFile = 'Evclid.in';
OutFile = 'Evclid.out';
var m, n, k, nod, i, max: integer;
begin
 assign(input, infile);
 reset(InPut);
 Read(InPut, m); Read(InPut, n); Read(InPut, K);
 Close(inPut);
 nod:= 1;
if m >= n then
 max:= m
else max:= n;
if k > max then
 max:= k;
for i:= 1 to max do
 if (m mod i = 0) and (n mod i = 0) and (k mod i = 0) and (i > nod) then
 nod:= i;
assign(OutPut, OutFile);
ReWrite(OutPut);
Write(OutPut, nod);
Close(output);
end.