<p>Given a string <code>n</code> representing an integer, return <em>the closest integer (not including itself), which is a palindrome</em>. If there is a tie, return <em><strong>the smaller one</strong></em>.</p>

<p>The closest is defined as the absolute difference minimized between two integers.</p>

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

<pre>
<strong>Input:</strong> n = &quot;123&quot;
<strong>Output:</strong> &quot;121&quot;
</pre>

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

<pre>
<strong>Input:</strong> n = &quot;1&quot;
<strong>Output:</strong> &quot;0&quot;
<strong>Explanation:</strong> 0 and 2 are the closest palindromes but we return the smallest which is 0.
</pre>

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

<ul>
	<li><code>1 &lt;= n.length &lt;= 18</code></li>
	<li><code>n</code> consists of only digits.</li>
	<li><code>n</code> does not have leading zeros.</li>
	<li><code>n</code> is representing an integer in the range <code>[1, 10<sup>18</sup> - 1]</code>.</li>
</ul>

class Solution:
    def nearestPalindromic(self, n: str) -> str:
        
        results = []

        length = len(n)

        if length == 1:
            return str(int(n)-1)
        
        results.append(10**length+1)
        results.append(10**(length-1)-1)
        
        mid = (length+1)//2

        prefix = int(n[:mid])

        prefixes = [prefix, prefix+1, prefix-1]

        for i in prefixes:
            res = str(i)

            if length % 2 == 1:
                res = res[:-1]
            
            peek = str(i) + res[::-1]
            results.append(int(peek))
    
        maxDiff = sys.maxsize
        result = tip = int(n)

        for i in range(5):
            if results[i] != tip and maxDiff > abs(results[i]-tip):
                maxDiff = abs(results[i]-tip)
                result = results[i]
            
            elif maxDiff == abs(results[i]-tip):

                result = min(results[i], result)
        
        return str(result)
16000