New Quest — Greatest Common Divisor
Karl has eighteen broadsheets from one parish and twelve from another. Liina wants them bundled into equal packets, the largest possible, with nothing left over. The answer is not built—it is uncovered, already hidden inside both numbers.
On the input tape, you’ll get two unary numbers separated by a comma. Your task is to find the greatest common divisor.