Given an even number (greater than 2), return two prime numbers whose sum will be equal to given number. There are several combinations possible. Print only first such pair.

**NOTE:** A solution will always exist, read Goldbach’s conjecture. Also, solve the problem in linear time complexity, i.e., O(n).

**Input:**

The first line contains T, the number of test cases. The following T lines consist of a number each, for which we'll find two prime numbers.

**Note**: The number would always be an even number.

**Output:**

For every test case print two prime numbers space separated, such that the smaller number appears first. Answer for each test case must be in a new line.

**Constraints:**

1 ≤ T ≤ 70

1 ≤ N ≤ 10000

**Example:**

**Input:**

5

74

1024

66

8

9990

**Output:**

3 71

3 1021

5 61

3 5

17 9973

Author: madhuradlakha

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Sulagna | 117 |

RUTVIKHARIPARA | 116 |

janvidavda105190 | 93 |

harshsiddhapura105461 | 93 |

madhursengar24 | 86 |

PiyushPandey4 | 617 |

ASWATHAMA | 561 |

akhyasharma01 | 547 |

john_wick | 521 |

jagrit_07 | 448 |

blackshadows | 5362 |

Ibrahim Nash | 5242 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4598 |

Login to report an issue on this page.