#include <bits/stdc++.h>
int n;
void solve() {
  int i, j, s, k, a[10005];
  s = 0;
  if (n < 4) {
    printf("NO");
    return;
  }
  if (n % 2 == 0) {
    printf("YES\n1 * 2 = 2\n3 * 4 = 12\n12 * 2 = 24\n");
    for (i = n; i > 5; i = i - 2) {
      k = i - 1;
      printf("%d - %d = 1\n", i, k);
    }
    for (i = 1; i <= (n - 4) / 2; i++) printf("24 * 1 = 24\n");
  } else {
    printf("YES\n5 * 4 = 20\n2 + 3 = 5\n5 - 1 = 4\n20 + 4 = 24\n");
    for (i = n; i > 6; i = i - 2) {
      k = i - 1;
      printf("%d - %d = 1\n", i, k);
    }
    for (i = 1; i <= (n - 5) / 2; i++) printf("24 * 1 = 24\n");
  }
  return;
}
int main() {
#pragma comment(linker, "/STACK:67108864")
  scanf("%d", &n);
  solve();
}
