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.InputStreamReader;
import java.io.IOException;
import java.util.ArrayList;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.Collection;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Hamed Valizadeh (havaliza@gmail.com)
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastInputReader in = new FastInputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }
}

class TaskA {
    String command(long x, long y, String operation) {
        long result = operation.equals("*") ? x * y : operation.equals("+") ? x + y : x - y;
        return "" + x + " " + operation + " " + y + " = " + result;
    }

    ArrayList<String> solve(int n) {
        if (n >= 8) {
            ArrayList<String> result = new ArrayList<String>();
            result.add(command(24, 0, "+"));
            while (n > 8) {
                result.add(command(0, n, "*"));
                n--;
            }
            result.add(command(1, 1, "-"));
            result.add(command(6, 5, "-"));
            result.add(command(8, 7, "-"));
            result.addAll(solve(4));
            return result;
        }

        ArrayList<Integer> list = new ArrayList<Integer>();
        for (int i = 1; i <= n; i++)
            list.add(i);
        return solve(list);
    }

    ArrayList<String> solve(ArrayList<Integer> list) {
        if (list.size() == 1) {
            if (list.get(0) == 24) {
                return new ArrayList<String>();
            }
            return null;
        }

        for (int i = 0; i < list.size(); i++)
            for (int j = i + 1; j < list.size(); j++) {
                ArrayList<Integer> tmpList = new ArrayList<Integer>(list);
                tmpList.remove(list.get(i));
                tmpList.remove(list.get(j));

                int x = list.get(i);
                int y = list.get(j);

                ArrayList<String> result;

                tmpList.add(x + y);
                result = solve(tmpList);
                if (result != null) {
                    result.add(command(x, y, "+"));
                    return result;
                }
                tmpList.remove(tmpList.size() - 1);

                tmpList.add(x - y);
                result = solve(tmpList);
                if (result != null) {
                    result.add(command(x, y, "-"));
                    return result;
                }
                tmpList.remove(tmpList.size() - 1);

                tmpList.add(x * y);
                result = solve(tmpList);
                if (result != null) {
                    result.add(command(x, y, "*"));
                    return result;
                }
                tmpList.remove(tmpList.size() - 1);
            }
        return null;
    }

    public void solve(int testNumber, FastInputReader in, PrintWriter out) {
        int n = in.nextInt();
        ArrayList<String> result = solve(n);

        if (result == null) {
            out.println("NO");
            return;
        }

        out.println("YES");
        for (int i = result.size() - 1; i >= 0; i--)
            out.println(result.get(i));
    }
}

class FastInputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public FastInputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }
}