comefrom: <doocs>0479.Largest Palindrome Product_1.py
code: def largestPalindrome( n: int) -> int:
      mx = 10**n - 1
      for a in range(mx, mx // 10, -1):
          b = x = a
          while b:
              x = x * 10 + b % 10
              b //= 10
          t = mx
          while t * t >= x:
              if x % t == 0:
                  return x % 1337
              t -= 1
      return 9
masked: def sample_funcname ( var_0 : int ) -> int :
      var_4 = 10 ** var_0 - 1
      for var_6 in range ( var_4 , var_4 // 10 , - 1 ) :
          var_8 = var_7 = var_6
          while var_8 :
              var_7 = var_7 * 10 + var_8 % 10
              var_8 //= 10
          var_9 = var_4
          while var_9 * var_9 >= var_7 :
              if var_7 % var_9 == 0 :
                  return var_7 % 1337
              var_9 -= 1
      return 9
  