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_1 = 10 ** var_0 - 1
      for var_2 in range ( var_1 , var_1 // 10 , - 1 ) :
          var_4 = var_3 = var_2
          while var_4 :
              var_3 = var_3 * 10 + var_4 % 10
              var_4 //= 10
          var_5 = var_1
          while var_5 * var_5 >= var_3 :
              if var_3 % var_5 == 0 :
                  return var_3 % 1337
              var_5 -= 1
      return 9
  