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;
inline void _() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); }
void __() {}
inline void ___(char *i, char *j) {
  freopen(i, "r", stdin);
  freopen(j, "w", stdout);
}
template <class T1>
bool tk(T1 &e1) {
  if (cin >> e1) return true;
  return false;
}
template <class T1, class T2>
bool tk(T1 &e1, T2 &e2) {
  if (cin >> e1 >> e2) return true;
  return false;
}
template <class T1, class T2, class T3>
bool tk(T1 &e1, T2 &e2, T3 &e3) {
  if (cin >> e1 >> e2 >> e3) return true;
  return false;
}
template <class T1, class T2, class T3, class T4>
bool tk(T1 &e1, T2 &e2, T3 &e3, T4 &e4) {
  if (cin >> e1 >> e2 >> e3 >> e4) return true;
  return false;
}
template <class T1, class T2, class T3, class T4, class T5>
bool tk(T1 &e1, T2 &e2, T3 &e3, T4 &e4, T5 &e5) {
  if (cin >> e1 >> e2 >> e3 >> e4 >> e5) return true;
  return false;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
bool tk(T1 &e1, T2 &e2, T3 &e3, T4 &e4, T5 &e5, T6 &e6) {
  if (cin >> e1 >> e2 >> e3 >> e4 >> e5 >> e6) return true;
  return false;
}
template <class T1>
void put(T1 e) {
  cout << e << endl;
}
template <class T1, class T2>
void put(T1 e1, T2 e2) {
  cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void put(T1 e1, T2 e2, T3 e3) {
  cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void put(T1 e1, T2 e2, T3 e3, T4 e4) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void put(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void put(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
       << endl;
}
template <class T1>
void putVec(vector<T1> e1) {
  for (int i = 0; i < (e1).size(); i++)
    (!i ? cout << e1[i] : cout << " " << e1[i]);
  cout << endl;
}
template <class T1>
void putArr(T1 arr[], int l) {
  for (int i = 0; i < l; i++) (!i ? cout << arr[i] : cout << " " << arr[i]);
  cout << endl;
}
template <class T1>
void bug(T1 e) {}
template <class T1, class T2>
void bug(T1 e1, T2 e2) {}
template <class T1, class T2, class T3>
void bug(T1 e1, T2 e2, T3 e3) {}
template <class T1, class T2, class T3, class T4>
void bug(T1 e1, T2 e2, T3 e3, T4 e4) {}
template <class T1, class T2, class T3, class T4, class T5>
void bug(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void bug(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {}
template <class T1>
void bugVec(vector<T1> e1) {}
template <class T1>
void bugArr(T1 arr[], int l) {}
template <typename T>
inline bool isOn(T &mask, int pos) {
  return ((mask) & (1 << pos));
}
template <typename T>
inline void setOff(T &mask, int pos) {
  mask = ((mask) & (~(1 << pos)));
}
template <typename T>
inline void setOn(T &mask, int pos) {
  mask = ((mask)(1 << pos));
}
namespace gv {};
long long absolute(long long a) {
  if (a < 0) return -a;
  return a;
}
int main() {
  _();
  string mpp[25];
  mpp[21] = "++++++ ";
  mpp[19] = "+++++- ";
  mpp[20] = "+++++* ";
  mpp[17] = "++++-+ ";
  mpp[15] = "++++-- ";
  mpp[16] = "++++-* ";
  mpp[13] = "+++-+- ";
  mpp[14] = "+++-+* ";
  mpp[11] = "+++--+ ";
  mpp[9] = "+++--- ";
  mpp[10] = "+++--* ";
  mpp[23] = "+++-*- ";
  mpp[24] = "+++-** ";
  mpp[12] = "++-++* ";
  mpp[7] = "++-+-- ";
  mpp[8] = "++-+-* ";
  mpp[5] = "++--+- ";
  mpp[6] = "++--+* ";
  mpp[3] = "++---+ ";
  mpp[1] = "++---- ";
  mpp[2] = "++---* ";
  mpp[22] = "++-*+- ";
  mpp[18] = "++-*-- ";
  mpp[4] = "+-+-+* ";
  mpp[0] = "+-+--* ";
  long long res = 0;
  int n;
  tk(n);
  if (n == 1 || n == 2 || n == 3) {
    put("NO");
    return 0;
  }
  put("YES");
  if (n == 4) {
    put("4 * 3 = 12\n", "12 * 2 = 24\n", "24 * 1 = 24\n");
    return 0;
  }
  if (n == 5) {
    put("4 * 5 = 20\n", "20 + 3 = 23\n", "23 + 2 = 25\n", "25 - 1 = 24\n");
    return 0;
  }
  if (n == 6) {
    put("6 * 5 = 30\n", "30 - 4 = 26\n", "26 - 3 = 23\n", "23 + 2 = 25\n",
        "25 - 1 = 24\n");
    return 0;
  }
  res = n;
  for (int i = n - 1; i > 6; i--) {
    if (res + i < 24)
      put(i, "+", res, "=", res + i), res += i;
    else
      put(res, "-", i, "=", res - i), res -= i;
  }
  bug(res);
  string op = "";
  if (res >= 0)
    op = mpp[24 - res];
  else
    op = mpp[24 + res];
  if (res >= 0) {
    int cur = 6;
    for (int i = 1; i < 6; i++) {
      if (op[i] == '+') {
        put(cur, "+", (6 - i), "=", cur + (6 - i)), cur += (6 - i);
      } else if (op[i] == '-') {
        put(cur, "-", (6 - i), "=", cur - (6 - i)), cur -= (6 - i);
      } else if (op[i] == '*') {
        put(cur, "*", (6 - i), "=", cur * (6 - i)), cur *= (6 - i);
      }
    }
  } else {
    int cur = 6;
    for (int i = 1; i < 6; i++) {
      if (op[i] == '-') {
        put(cur, "+", (6 - i), "=", cur + (6 - i)), cur += (6 - i);
      } else if (op[i] == '+') {
        put(cur, "-", (6 - i), "=", cur - (6 - i)), cur -= (6 - i);
      } else if (op[i] == '*') {
        put(cur, "*", (6 - i), "=", cur * (6 - i)), cur *= (6 - i);
      }
    }
  }
  put(res, "+", 24 - res, "=", 24);
  __();
}