<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 {
public:
    int largestPalindrome(int n) {
        if (n == 1) return 9;
        
        int upper = pow(10, n) - 1;
        int lower = pow(10, n - 1);
        
        for (int i = upper; i > lower; i--) {
            long long palindrome = createPalindrome(i);
            for (long long j = upper; j * j > palindrome; j--) {
                if (palindrome % j == 0) {
                    long long factor = palindrome / j;
                    if (factor >= lower && factor <= upper) {
                        return palindrome % 1337;
                    }
                }
            }
        }
        
        return 0; // This line should never be reached for valid inputs
    }
    
private:
    long long createPalindrome(int num) {
        long long palindrome = num;
        while (num > 0) {
            palindrome = palindrome * 10 + (num % 10);
            num /= 10;
        }
        return palindrome;
    }
};
7600