#include <bits/stdc++.h>
using namespace std;
string vow = "aeiou";
const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1};
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const long double pie = 3.14159265358979;
const long long mod = 1e9 + 7;
void solve(int test_case) {
  int n;
  cin >> n;
  if (n < 4) {
    cout << "NO";
    cout << "\n";
    ;
    return;
  }
  cout << "YES";
  cout << "\n";
  int v;
  if (n % 2)
    v = 5;
  else
    v = 4;
  int op = 0;
  for (int i = v + 1; i < n; i += 2) {
    cout << i + 1 << " - " << i << " = 1\n";
    op++;
  }
  if (v == 4) {
    cout << "1 * 2 = 2";
    cout << "\n";
    cout << "2 * 3 = 6";
    cout << "\n";
    cout << "6 * 4 = 24";
    cout << "\n";
    op += 3;
  } else {
    cout << "5 - 3 = 2";
    cout << "\n";
    cout << "2 * 4 = 8";
    cout << "\n";
    cout << "1 + 2 = 3";
    cout << "\n";
    cout << "8 * 3 = 24";
    cout << "\n";
    op += 4;
  }
  op = n - 1 - op;
  while (op--) cout << "24 * 1 = 24\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int i = 0; i < t; i++) solve(i);
  return 0;
}
