Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

SICT1036 - ХИЕХ

m, n (0< m, n<=100) 2 бүхэл тоо өгөгдөнө. Уг 2 тооны хамгийн их ерөнхий хуваагчийг ол. Рекурсив функц ашиглана уу.

Input

2 бүхэл тоо хоосон зайгаар тусгаарлагдан өгөгдөнө.

Output

ХИЕХ хэвлэгдэнэ.

Example

Input:
8 12

Output:
4

Added by:B@TJ@RG@L
Date:2014-04-05
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:C C++ 4.3.2 PYTHON

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.