+==============================================================================+
|  DECRYPTION STATION — PUZZLE #13278                                |
+==============================================================================+

  CIPHER TYPE:     EUCLIDEAN-ALGORITHM
  SECURITY LEVEL:  5/7

  STATUS:          [ACTIVE — AWAITING DECRYPTION]


  MISSION BRIEFING
  ----------------
Euclid's algorithm finds the GCD of two numbers through repeated division. Given a = 120 and b = 48, run the Euclidean algorithm and count the number of division steps. Steps mod 26 → letter.

  INTERCEPTED DATA
  ----------------





> a:
  120



> b:
  48



> hint:
  While b ≠ 0: (a, b) = (b, a % b). Starting from (120, 48), it takes 2 steps. 2 % 26 = 2 → 'c'.



> answer format:
  single lowercase letter





  [INTEL] Pool fill: euclidean-algorithm diff 5


  DECRYPTION INPUT
  ----------------


    
    > ENTER PLAINTEXT: 
    > OPERATOR ID (optional): 
    


    [ SUBMIT SOLUTION ]





  NAVIGATION
  ----------
  [LEARN] Study this cipher type
  [BROWSE] Return to database