用汇编语言实现的验证简单的哥德巴赫猜想的代码，简化的歌德巴赫猜想：任何一个大于6的偶数均可以表示为两个素数之和。现从键盘输入一个0～65535之间的无符号整数，试验证歌德巴赫猜想。

如输入数12，输出：

12=5+7

如输入数20,输出：

20=3+17

20=7+13

如输入数7,输出：

Must be even

如输入数3,输出：

Must be greater than or equal to 6-Using assembly language to achieve a simple Goldbach conjecture verification code, simplified Goldbach conjecture: Any even number greater than 6 are can be expressed as the sum of two primes. Now from the keyboard to enter a 0 to 65535 unsigned integer test certificate Goldbach conjecture. If the input number 12, output: 12 = 5+7 number 20 as input, output: 20 = 3+17 20 = 7+13 number seven as input and output: Must be even number 3 as input and output: Must be greater than or equal to 6