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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.ListIterator;
import java.util.PriorityQueue;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class CopyOfCopyOfSolution {

    public static void main(String[] args) throws NumberFormatException,
            IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        int n = in.nextInt();
        if (n <= 3) {
            out.println("NO");
        } else {
            out.println("YES");
            int prev = n;
            for (int i = n - 1; i > 4; i--) {
                int a = Math.max(i, prev);
                int b = Math.min(i, prev);
                out.println(a + " - " + b + " = " + (a - b));
                prev = a - b;
            }
            //System.out.println("$" + prev);
            int val = 0;
            if(n == 4) {
                out.println("4 * 3 = 12");
                out.println("12 * 1 = 12");
                out.println("12 * 2 = 24");
            }
            else if (prev == 0) {
                out.println("0 * 1 = 0");
                out.println("4 + 0 = 4");
                out.println("4 * 3 = 12");
                out.println("12 * 2 = 24");
            } else if (prev == 1) {
                out.println("1 - 1 = 0");
                out.println("4 + 0 = 4");
                out.println("4 * 3 = 12");
                out.println("12 * 2 = 24");
            } else if (prev == 4) {
                out.println("4 + 4 = 8");
                out.println("2 - 1 = 1");
                out.println("8 * 1 = 8");
                out.println("8 * 3 = 24");
            } else if (prev == 5) {
                out.println("5 + 1 = 6");
                out.println("3 - 2 = 1");
                out.println("6 * 4 = 24");
                out.println("24 * 1 = 24");
            } else {
                throw new Error("prev=" + prev);
            }
        }
        out.close();
    }

    private static boolean isValid(int[] a, Integer[] c, int off) {
        boolean first = false;
        for (int i = 0; i <= 1000; i++) {
            int index = Arrays.binarySearch(a, i);
            if (index < 0) {
                int xx = Math.abs(index + 1);
                if (xx % 2 == 0) {
                    continue;
                }
            } else if (index >= a.length) {
                continue;
            }

            index = Arrays.binarySearch(c, i, new Baba(off));
            // System.out.println("Index" + index + " for i " + i + " off="+
            // off);
            if (index < 0) {
                int xx = Math.abs(index + 1);
                if (xx % 2 == 0) {
                    continue;
                }
            } else if (index >= c.length) {
                continue;
            }
            return true;
        }
        return false;
    }

    private static class Baba implements Comparator<Integer> {
        int off;

        Baba(int off) {
            this.off = off;
        }

        @Override
        public int compare(Integer o1, Integer o2) {
            return Integer.compare(o1 + off, o2);
        }
    }

    private static int diff(int i, int j) {
        int c = 0;
        while (i > 0 || j > 0) {
            if (((j & 1) ^ (i & 1)) != 0) {
                c++;
            }
            j >>= 1;
            i >>= 1;
        }
        return c;
    }

    private static void print(int[][] m) {
        // TODO Auto-generated method stub
        int n = m.length;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                System.out.print(m[i][j]);
            }
            System.out.println();
        }

    }

    private static boolean mark(int[][] m, int a, int b) {
        if (m[a][b] == 0 || m[a][b] == 2) {
            return true;
        }
        // a and b are topmost
        m[a][b] = 2;
        if (b < m.length - 1 && a < m.length - 2 && m[a + 1][b + 1] == 1
                && m[a + 1][b] == 1 && b > 0 && m[a + 1][b - 1] == 1
                && m[a + 2][b] == 1) {
            m[a + 1][b + 1] = 2;
            m[a + 1][b] = 2;
            m[a + 1][b - 1] = 2;
            m[a + 2][b] = 2;
            return true;
        }
        // Left most
        if (b < m.length - 2 && a > 0 && a < m.length - 1 && m[a][b + 1] == 1
                && m[a][b + 2] == 1 && m[a + 1][b + 1] == 1
                && m[a - 1][b + 1] == 1) {
            m[a][b + 1] = 2;
            m[a][b + 2] = 2;
            m[a - 1][b + 1] = 2;
            m[a + 1][b + 1] = 2;
            return true;
        }
        return false;
    }

    private static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            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());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}