<p>Given an integer n, return <em>the <strong>largest palindromic integer</strong> that can be represented as the product of two <code>n</code>-digits integers</em>. Since the answer can be very large, return it <strong>modulo</strong> <code>1337</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 2
<strong>Output:</strong> 987
Explanation: 99 x 91 = 9009, 9009 % 1337 = 987
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 1
<strong>Output:</strong> 9
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 8</code></li>
</ul>

class Solution:
    def largestPalindrome(self, n: int) -> int:
        if n == 1: return 9
        upper_bound = 10**n - 1
        lower_bound = 10**(n-1)

        for i in range(upper_bound, lower_bound, -1):
            palindrome = int(str(i) + str(i)[::-1])
            for j in range(upper_bound, int(palindrome**0.5), -1):
                if palindrome // j > upper_bound:
                    break
                if palindrome % j == 0:
                    return palindrome % 1337
16200