# Hello Konstantinos! :)

## Palindromes

Write a small function that finds `p` the smallest palindrome number such as `p > 20` and the square of `p` is a palindrome number.

[21, ...]

101
1221

# Your code here
def is_palindrome(n):
    num = str(n)
    
    return num == num[::-1]
    if len(num) % 2 != 0:
        m = len(num)/2
        return num[:m] == num[m+1::-1]
    else:
        m = len(num)/2
        return num[:m] == num[m::-1]
        
def palindromes():
    s = 21
    
    while True:
        if is_palindrome(s) and is_palindrome(s**s):
            return s
            
        s += 1