Solve Goldbach's Conjecture
Goldbach's Conjecture states that every even whole number greater than 2 is the sum of 2 prime numbers. Your task is to return those 2 prime numbers, given an even whole number as input. There are often multiple solutions - any solution will do.
These examples only show one of potentially many possible outputs.
4 -> 2, 2 6 -> 3, 3 24 -> 5, 19 120 -> 7, 113 1000 -> 3, 997
This is code golf, so shortest answer in each language wins.
P.S. If no one finds a test case that has no solution, I'll consider the problem solved by engineer's induction.
[Husk], 9 bytes ḟo=⁰Σπ2 …
Japt, 13 bytes o ï æ@¶X …
[APL (Dyalog Unicode)], 32 byt …