While surfing in web I found interesting math problem called "Always perfect". That means if you add 1 to the product of four consecutive numbers the answer is ALWAYS a perfect square.
For example we have: 1,2,3,4 and the product will be 1X2X3X4=24. If we add 1 to the product that would become 25, since the result number is a perfect square the square root of 25 would be 5.
So now lets write a function which takes numbers separated by commas in string format and returns the number which is a perfect square and the square root of that number.
If string contains other characters than number or it has more or less than 4 numbers separated by comma function returns "incorrect input".
If string contains 4 numbers but not consecutive it returns "not consecutive".
import re
def check_root(string):
    if not re.fullmatch(r"(-?\d+,){3}-?\d+", string):
        return 'incorrect input'
    a, b, c, d = list(map(int, string.split(",")))
    if not d == c + 1 == b + 2 == a + 3:
        return 'not consecutive'
    return f"{a * b * c * d + 1}, {abs(b ** 2 + a)}"
    
        
    

import re
def check_root(string):
    if not re.fullmatch(r"(-?\d+,){3}-?\d+", string):
        return 'incorrect input'
    a, b, c, d = list(map(int, string.split(",")))
    if not d == c + 1 == b + 2 == a + 3:
        return 'not consecutive'
    return f"{a * b * c * d + 1}, {abs(b ** 2 + a)}"
    
        
    
