#include <bits/stdc++.h>
using namespace std;
bool isprime(long long int n) {
  for (long long int i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
void solve() {
  vector<long long int> v;
  long long int n, m, j, y, i, k, x = 0, c = 0, c2 = 5, d, ttc, z, p, q;
  cin >> n;
  if (n <= 3) {
    cout << "NO" << endl;
    return;
  }
  cout << "YES" << endl;
  if (n % 2 == 0) {
    cout << "1 * 2 = 2\n2 * 3 = 6\n6 * 4 = 24\n";
    x = 5;
  } else {
    cout << "4 * 5 = 20\n3 + 2 = 5\n20 + 5 = 25\n25 - 1 = 24\n";
    x = 6;
  }
  for (i = x; i <= n; i += 2) {
    cout << i + 1 << " - " << i << " = " << 1 << endl;
    cout << "1 * 24 = 24" << endl;
  }
}
int main() {
  int T = 1;
  while (T--) solve();
  return 0;
}
