#include <bits/stdc++.h>
using namespace std;
inline long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
inline long long power(long long a, long long n, long long m) {
  if (n == 0) return 1;
  long long p = power(a, n / 2, m);
  p = (p * p) % m;
  if (n % 2)
    return (p * a) % m;
  else
    return p;
}
const long long MOD = 1000000007;
int solve(int n) {
  if (n <= 3) {
    cout << "NO";
    return 0;
  }
  if (n == 4) {
    cout << "1 * 2 = 2"
         << "\n"
         << "2 * 3 = 6"
         << "\n"
         << "6 * 4 = 24"
         << "\n";
    return 0;
  }
  if (n == 5) {
    cout << "1 + 2 = 3"
         << "\n"
         << "5 - 3 = 2"
         << "\n"
         << "3 * 4 = 12"
         << "\n"
         << "12 * 2 = 24"
         << "\n";
    return 0;
  }
  solve(n - 2);
  cout << n << " - " << n - 1 << " = 1"
       << "\n"
       << "24 * 1 = 24"
       << "\n";
  return 0;
}
int main() {
  int n;
  cin >> n;
  if (n > 3) {
    cout << "YES"
         << "\n";
  }
  solve(n);
}
