#include <bits/stdc++.h>
using namespace std;
const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dc[] = {0, 1, 0, -1, 1, -1, -1, 1};
const double eps = 1e-9;
const int INF = 0x7FFFFFFF;
const long long INFLL = 0x7FFFFFFFFFFFFFFFLL;
const double pi = acos(-1);
template <class T>
T take(queue<T> &O) {
  T tmp = O.front();
  O.pop();
  return tmp;
}
template <class T>
T take(stack<T> &O) {
  T tmp = O.top();
  O.pop();
  return tmp;
}
template <class T>
T take(priority_queue<T> &O) {
  T tmp = O.top();
  O.pop();
  return tmp;
}
template <class T>
inline void getint(T &num) {
  bool neg = 0;
  num = 0;
  char c;
  while ((c = getchar_unlocked()) && (!isdigit(c) && c != '-'))
    ;
  if (c == '-') {
    neg = 1;
    c = getchar_unlocked();
  }
  do num = num * 10 + c - '0';
  while ((c = getchar_unlocked()) && isdigit(c));
  num *= (neg) ? -1 : 1;
}
template <class T>
inline bool inRange(T z, T a, T b) {
  return a <= z && z <= b;
}
void OPEN(string in = "input.txt", string out = "output.txt") {
  freopen(in.c_str(), "r", stdin);
  freopen(out.c_str(), "w", stdout);
  return;
}
int n;
int main(int argc, const char *argv[]) {
  cin >> n;
  if (n < 4)
    cout << "NO\n";
  else {
    cout << "YES\n";
    int cnt = 0, nao;
    if (n & 1) {
      cnt = n - 5, nao = 6;
      for (int(i) = (0), _t = (cnt / 2); i < (_t); ++(i)) {
        cout << nao + 1 << " - " << nao << " = 1\n";
        nao += 2;
      }
      cout << "4 + 1 = 5\n"
              "5 * 5 = 25\n"
              "3 - 2 = 1\n"
              "25 - 1 = 24\n";
      for (int(i) = (0), _t = (cnt / 2); i < (_t); ++(i))
        cout << "24 * 1 = 24\n";
    } else {
      cout << "1 * 2 = 2\n"
              "2 * 3 = 6\n"
              "6 * 4 = 24\n";
      cnt = n - 4, nao = 5;
      for (int(i) = (0), _t = (cnt / 2); i < (_t); ++(i)) {
        cout << nao + 1 << " - " << nao << " = 1\n";
        nao += 2;
      }
      for (int(i) = (0), _t = (cnt / 2); i < (_t); ++(i))
        cout << "24 * 1 = 24\n";
    }
  }
  return 0;
}
