Problem: 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?

Input

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

Output

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.

Examples

Input

1


Output

NO


Input

8


Output

YES
8 * 7 = 56
6 * 5 = 30
3 - 4 = -1
1 - 2 = -1
30 - -1 = 31
56 - 31 = 25
25 + -1 = 24

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int dx[8] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[8] = {0, 0, -1, 1, 1, -1, -1, 1};
int n;
void add(int i, int j) { printf("%d + %d = %d\n", i, j, i + j); }
void sub(int i, int j) { printf("%d - %d = %d\n", i, j, i - j); }
void mul(int i, int j) { printf("%d * %d = %lld\n", i, j, 1LL * i * j); }
void solve4() {
  mul(4, 2);
  mul(3, 1);
  mul(8, 3);
}
void solve5() {
  add(5, 1);
  sub(3, 2);
  mul(4, 1);
  mul(6, 4);
}
int o;
int main() {
  scanf("%d", &n);
  if (n < 4) {
    cout << "NO" << endl;
    return 0;
  }
  puts("YES");
  if (n == 4) {
    solve4();
    return 0;
  }
  if (n == 5) {
    solve5();
    return 0;
  }
  if (n & 1) {
    for (int i = 6; i <= n; i += 2) {
      sub(i + 1, i);
      o++;
    }
    solve5();
    while (o--) {
      mul(24, 1);
    }
    return 0;
  }
  for (int i = 5; i <= n; i += 2) {
    sub(i + 1, i);
    o++;
  }
  solve4();
  while (o--) {
    mul(24, 1);
  }
  return 0;
}