Problem: Little X used to play a card game called "24 Game", but recently he has found it too easy. So he invented a new game.

Initially you have a sequence of n integers: 1, 2, ..., n. In a single step, you can pick two of them, let's denote them a and b, erase them from the sequence, and append to the sequence either a + b, or a - b, or a × b.

After n - 1 steps there is only one number left. Can you make this number equal to 24?

Input

The first line contains a single integer n (1 ≤ n ≤ 105).

Output

If it's possible, print "YES" in the first line. Otherwise, print "NO" (without the quotes).

If there is a way to obtain 24 as the result number, in the following n - 1 lines print the required operations an operation per line. Each operation should be in form: "a op b = c". Where a and b are the numbers you've picked at this operation; op is either "+", or "-", or "*"; c is the result of corresponding operation. Note, that the absolute value of c mustn't be greater than 1018. The result of the last operation must be equal to 24. Separate operator sign and equality sign from numbers with spaces.

If there are multiple valid answers, you may print any of them.

Examples

Input

1


Output

NO


Input

8


Output

YES
8 * 7 = 56
6 * 5 = 30
3 - 4 = -1
1 - 2 = -1
30 - -1 = 31
56 - 31 = 25
25 + -1 = 24

Solution (in JAVA):

Solution:
import java.io.BufferedWriter;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class A488 {
	public static String[] thanks = { "vaporeon", "jolteon", "flareon",
			"espeon", "umbreon", "leafeon", "glaceon", "sylveon" };
	public static PrintWriter out;

	public static void main(String[] Args) throws Exception {
		Scanner sc = new Scanner(System.in);
		out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(
				System.out)));
		int n = sc.nextInt();
		if (n >= 4) {
			out.println("YES");
			if (n % 2 == 0) {
				for (int j = 5; j <= n; j += 2) {
					out.println((j + 1) + " - " + (j) + " = 1");
					out.println("1 * 1 = 1");
				}
				out.println("2 * 1 = 2");
			} else {
				for (int j = 6; j <= n; j += 2) {
					out.println((j + 1) + " - " + (j) + " = 1");
					out.println("1 * 1 = 1");
				}
				out.println("5 - 1 = 4");
				out.println("4 - 2 = 2");
			}
			out.println("2 * 3 = 6");
			out.println("6 * 4 = 24");
		} else {
			out.println("NO");
		}
		out.close();
	}

	public static long[][] matPowExp(long[][] mat, long exp, long mod)
			throws Exception {
		if (exp == 0) {
			return new long[][] { { 1, 0 }, { 0, 1 } };
		}
		if (exp == 1) {
			return mat;
		}
		long[][] builder = matPowExp(mat, exp / 2, mod);
		long[][] ret = matMult(builder, builder, mod);

		if (exp % 2 == 1) {
			ret = matMult(ret, mat, mod);
		}

		return ret;
	}

	public static long[][] matMult(long[][] a, long[][] b, long mod)
			throws Exception {
		if (a[0].length != b.length) {
			throw new Exception("Bad matrix dimensions");
		}

		long[][] c = new long[a.length][b[0].length];

		for (int k = 0; k < a.length; k++) {
			for (int j = 0; j < b[0].length; j++) {
				for (int i = 0; i < a[0].length; i++) {
					c[k][j] += a[k][i] * b[i][j];
					c[k][j] %= mod;
				}
			}
		}

		return c;
	}

	private static long choo(int k, int n) {
		if (k < 0 || k > n)
			return 0;
		long ret = fact(n) / (fact(k) * fact(n - k));
		return ret;
	}

	private static long fact(int n) {
		if (n == 0 || n == 1)
			return 1;
		return fact(n - 1) * n;
	}

	public static class Pair implements Comparable<Pair> {
		int t;
		int num;
		String team;
		int t2;

		public int compareTo(Pair o) {
			if (t != o.t)
				return t - o.t;
			return t2 - o.t2;
		}
	}

	public static long comp527A(long a, long b) {
		if (a == 0 || b == 0) {
			return 0;
		}
		if (a > b) {
			return comp527A(b, a);
		}
		return (b / a) + comp527A(b % a, a);
	}
}