<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;
        long long l=pow(10,n-1), r=pow(10,n)-1;
        for(long long x=r; x>=l; x--)
        {
            string s=to_string(x);
            string rev=s;
            reverse(rev.begin(),rev.end());
            s=s+rev;
            long long palin=stoll(s);
            for(long long y=r; y*y>=palin; y--)
            {
                if(palin/y>r) break;
                if(palin%y==0) return (int)(palin%1337);
            }
        }
        return -1;
    }
};
11700