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.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/**
 * Created by karlicos on 9/20/14.
 */
public class A {
    private static enum Op {
        ADD,
        SUB,
        MUL
    }

    static String getOpString(Op op) {
        switch (op) {
            case ADD: return "+";
            case SUB: return "-";
            case MUL: return "*";
        }
        return null;
    }

    private static class Entry {
        private Entry(long first, long second, Op op, long res) {
            this.first = first;
            this.second = second;
            this.res = res;
            this.op = op;
        }

        public long first;
        public long second;
        public long res;
        public Op op;

        @Override
        public String toString() {
            return String.format("%d %s %d = %d", first, getOpString(op), second, res);
        }
    }

    public List<Entry> solve(int n) {
        if (n <= 3) {
            return null;
        }
        List<Entry> res = new ArrayList<>();
        int alal = n % 4;
        if (alal == 0) {
            // 1 2 3 4
            res.add(new Entry(1, 2, Op.MUL, 2));
            res.add(new Entry(2, 3, Op.MUL, 6));
            res.add(new Entry(6, 4, Op.MUL, 24));
        } else if (alal == 1) {
            //  1 2 3 4 5
            res.add(new Entry(4, 5, Op.MUL, 20));
            res.add(new Entry(20, 3, Op.ADD, 23));
            res.add(new Entry(23, 2, Op.ADD, 25));
            res.add(new Entry(25, 1, Op.SUB, 24));
        } else if (alal == 2) {
            //  1 2 3 4 5 6
            res.add(new Entry(2, 3, Op.MUL, 6));
            res.add(new Entry(6, 4, Op.MUL, 24));
            res.add(new Entry(24, 5, Op.ADD, 29));
            res.add(new Entry(29, 1, Op.ADD, 30));
            res.add(new Entry(30, 6, Op.SUB, 24));
        } else { // 3
            //  1 2 3 4 5 6 7
            res.add(new Entry(1, 2, Op.SUB, -1));
            res.add(new Entry(-1, 3, Op.ADD, 2));
            res.add(new Entry(2, 4, Op.ADD, 6));
            res.add(new Entry(6, 5, Op.ADD, 11));
            res.add(new Entry(11, 6, Op.ADD, 17));
            res.add(new Entry(17, 7, Op.ADD, 24));
        }
        int cur = n;
        while (cur >= 8) {
            int tr = 24;
            res.add(new Entry(tr, cur, Op.ADD, tr + cur));
            tr += cur;
            res.add(new Entry(tr, cur - 3, Op.ADD, tr + cur - 3));
            tr += cur - 3;
            res.add(new Entry(tr, cur - 1, Op.SUB, tr - (cur - 1)));
            tr -= cur - 1;
            res.add(new Entry(tr, cur - 2, Op.SUB, tr - (cur - 2)));
            tr -= cur - 2;
            cur -= 4;
        }
        return res;
    }

    public static void main(String[] args) throws Exception {
        new A().run();
    }

    public void run() throws Exception {
        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);

        int n = sc.nextInt();
        List<Entry> res = solve(n);
        if (res == null) {
            pw.println("NO");
        } else {
            pw.println("YES");
            for (Entry e: res) {
                pw.println(e.toString());
            }
        }

        sc.close();
        pw.close();
    }
}