06. Greatest Common Divisor

#include <iostream>

using namespace std;

int main() {
    int firstNumber, secondNumber;
    cin >> firstNumber >> secondNumber;

    for (int i = 10; i > 0; i--) {
        if (firstNumber % i == 0 && secondNumber % i == 0) {
            cout << i << endl;
            return 0;
        }
    }
}