CF468A.24 Game

Little X used to play a card game called "24 Game", but recently he has found it too easy. So he invented a new game.

Initially you have a sequence of n integers: 1, 2, ..., n. In a single step, you can pick two of them, let's denote them a and b, erase them from the sequence, and append to the sequence either a + b, or a - b, or a × b.

After n - 1 steps there is only one number left. Can you make this number equal to 24?

小 X 曾经玩过一种名为“24 点游戏”的纸牌游戏，但最近他觉得这个游戏太简单了。于是他发明了一种新游戏。

初始时，你有一个由 $n$ 个整数组成的序列：$1,\,2,\,\dots,\,n$。在每一步操作中，你可以从中任选两个数，记为 $a$ 和 $b$，将它们从序列中删除，并将 $a + b$、$a - b$ 或 $a \times b$ 中的一个结果添加到序列末尾。

经过 $n - 1$ 步操作后，序列中仅剩一个数。你能否使这个数恰好等于 $24$？

The first line contains a single integer n (1 ≤ n ≤ 105).

第一行包含一个整数 $n$（$1 \leq n \leq 10^5$）。

If it's possible, print "YES" in the first line. Otherwise, print "NO" (without the quotes).

If there is a way to obtain 24 as the result number, in the following n - 1 lines print the required operations an operation per line. Each operation should be in form: "a op b = c". Where a and b are the numbers you've picked at this operation; op is either "+", or "-", or "*"; c is the result of corresponding operation. Note, that the absolute value of c mustn't be greater than 1018. The result of the last operation must be equal to 24. Separate operator sign and equality sign from numbers with spaces.

If there are multiple valid answers, you may print any of them.

如果可以，请在第一行输出“YES”。否则，请输出“NO”（不带引号）。

如果存在一种方式使得最终结果为 24，则在接下来的 $n-1$ 行中，每行输出一个所需的操作，每个操作格式为：“a op b = c”。其中 a 和 b 是本次操作所选取的两个数；op 为 +、- 或 * 中的一个；c 为该运算的结果。注意：c 的绝对值不得超过 $10^{18}$。最后一次操作的结果必须恰好等于 24。请用空格将运算符和等号与数字分隔开。

若存在多个合法答案，输出任意一个即可。