Given n, take the sum of the digits of n and continue until it reaches to single-digit - Codewars solution(Python)

def digital_root(n):

    x = sum(int(i) for i in str(n))

    if x > 9:

        return digital_root(x)

    return x

print(digital_root(2333))