text: D\n\nthis is kind of a silly question -- the true number of steps is 3\n13405 / 1027\n 1027 /   54\n   54 /    1\n    1 /    0\n\ntechnically speaking, the euclidean algorithm is O(n) where n is # of digits in the input.