def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

def extract_primes(n):
    p = set()
    s = str(n)
    for l in range(1, len(s) + 1):
        for i in range(len(s) - l + 1):
            x = int(s[i:i+l])
            if is_prime(x):
                p.add(x)
    if p:
        print(*sorted(p))
    else:
        print("No prime numbers found")

def main():
    n = int(input())
    extract_primes(n)

if __name__ == "__main__":
    main()

def main():
    print("do not " + input().strip())
main()

def solve(Q, X, Y, N):
    MOD = 10**9 + 7
    ans = 0
    for i in range(Q):
        x = X[i]
        y = Y[i]
        n = N[i]
        curr = 0
        for j in range(n):
            curr ^= (x + j) * y
        ans = (ans + curr) % MOD
    return ans

All placement help available