Machine :) (Codechef Contest Problem)

 Question:-

Charlie found a machine while on exploration. He brought the machine to you but you realize that first you need to unlock the machine with a series of steps. Luckily, Charlie had also found a paper containing series of numbers to unlock the machine in T steps. Each step requires an input K to proceed. But unfortunately, the key of digit 7 is broken.

You also find out that instead of a single input, you can give two inputs for each step such that the result adds upto K. Since the key 7 is broken, you proceed with the option of breaking up the number into two parts so that you can avoid entering the digit 7.

Your job is to write a program which will break Kinto two parts a and b such that K=a+b and neither of a or b has digit 7.

Example: K = 3576 can be broken into a = 1633 and b = 1943

Input:

• First line will contain T, number of steps. Then the steps follow.
• Each step contains of a single line of input, a integer K
  

Output:

For each testcase, output in a single line a and b separated by space. If there are multiple correct answers print any.

Constraints

• 1≤T≤105
  
• 2≤K≤10100
  

It is guaranteed that each K will have at least one digit as 7.

Sample Input:

5
2745
47736
175
976
3777

Sample Output:

1186 1559
8420 39316
83 92
311 665
1584 2193

EXPLANATION:

For each step, output a and b sums upto K and don't contain digit 7 :
1186+1559=2745
8420+39316=47736
83+92=175
311+665=976
1584+2193=3777
There could be multiple answers, all answers which result in K=a+b and where a and b don't contain a digit 7 will be accepted
Solution:-
for _ in range(int(input())):
          n = int(input())
          count = 0
          val = str(n)
          ans = ''
          for i in val:
                    if i == '7':
                              ans += '1'
                    else:
                              ans += i
          h = int(ans)
          original = n - h
          print(h, original)