# GDCOFTI - Greatest Common Divisor Of Three Integers

## 题意翻译

求三个数的最大公约数
Translated by @Dr.九命猫

## 题目描述

It is said that the greatest common divisor (GCD) of two or more whole integers, is the largest integer that divides them without leaving residue. Euclid's algorithm is famous for allowing to find the GCD between two integers. This challenge asks you, you find the GCD between three integers.
**Challenge**
The entry consists of 3 whole nonnegative integers (< 2 $ ^{64} $ ), one per line and the output will be the GCD of the 3 integers.
**Example of input**
```
426
132
120
```
**Example of output for this input**
`6`**Example of input:**
```
100
60
120
```
**Example of output for this input**
`20`**Example of input:**
```
4
8
12
```
**Example of output for this input**
`4`

## 输入输出格式

### 输入格式

### 输出格式

## 输入输出样例

*暂无测试点*