function gcd(firstNumber: number, secondNumber: number): number {
  let arrOne = []
  let arrTwo = []
  let max = Math.max(firstNumber, secondNumber)
  let result = []

  for(let i = 1; i <= firstNumber; i++){
    if(firstNumber % i === 0) arrOne.push(i)
  }

  for(let j = 1; j <= secondNumber; j++){
    if(secondNumber % j === 0) arrTwo.push(j)
  }
  
  for(let k = 0; k <= max; k++){
    if(arrOne.includes(arrTwo[k])) result.push(arrTwo[k])
  }

  return Math.max(...result);
}

// No modificar: necesario para evaluar el resultado.
export { gcd };