One way to create a task is to learn from math. You can generate some random math statement or modify some theorems to get something new and build a new task from that.For example, there is a statement called the "Goldbach's conjecture". It says: "each even number no less than four can be expressed as the sum of two primes". Let's modify it. How about a statement like that: "each integer no less than 12 can be expressed as the sum of two composite numbers." Not like the Goldbach's conjecture, I can prove this theorem.You are given an integer n no less than 12, express it as a sum of two composite numbers.InputThe only line contains an integer n (12 ≤ n ≤ 106).OutputOutput two composite integers x and y (1 < x, y < n) such that x + y = n. If there are multiple solutions, you can output any of them.

To solve this problem, you can follow these steps:

1. Check if the given integer n is greater than or equal to 12 and less than or equal to 10^6. If not, return an error message.

2. If n is even, you can simply return 4 and n-4 as the two composite numbers. This is because 4 is a composite number and the difference between an even number and 4 is also a composite number.

3. If n is odd, you can return 9 and n-9 as the two composite numbers. This is because 9 is a composite number and the difference between an odd number greater than or equal to 12 and 9 is an even number, which is also a composite number.

4. Print or return the two composite numbers x and y such that x + y = n.

Here is a Python code snippet that implements these steps:

def find_composite_numbers(n):
    if n < 12 or n > 10**6:
        return "Invalid input. Please enter an integer no less than 12 and no greater than 10^6."
    elif n % 2 == 0:
        return 4, n - 4
    else:
        return 9, n - 9

n = int(input())
x, y = find_composite_numbers(n)
print(x, y)

This code first checks if the input n is valid. If n is even, it returns 4 and n-4. If n is odd, it returns 9 and n-9. Finally, it prints the two composite numbers.