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:
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.text.*;

public class cf469c {

    static BufferedReader br;
    static Scanner sc;
    static PrintWriter out;
    
    public static void initA() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
            sc = new Scanner(System.in);
            out = new PrintWriter(System.out);
        } catch (Exception e) {
        }
    }
    
    static boolean next_permutation(Integer[] p) {
        for (int a = p.length - 2; a >= 0; --a) {
            if (p[a] < p[a + 1]) {
                for (int b = p.length - 1;; --b) {
                    if (p[b] > p[a]) {
                        int t = p[a];
                        p[a] = p[b];
                        p[b] = t;
                        for (++a, b = p.length - 1; a < b; ++a, --b) {
                            t = p[a];
                            p[a] = p[b];
                            p[b] = t;
                        }
                        return true;
                    }
                }
            }
        }
        return false;
    }
    
    public static String getString() {
        try {
            return br.readLine();
        } catch (Exception e) {
        }
        return "";
    }
    
    public static Integer getInt() {
        try {
            return Integer.parseInt(br.readLine());
        } catch (Exception e) {
        }
        return 0;
    }
    
    public static Integer[] getIntArr() {
        try {
            StringTokenizer temp = new StringTokenizer(br.readLine());
            int n = temp.countTokens();
            Integer temp2[] = new Integer[n];
            for (int i = 0; i < n; i++) {
                temp2[i] = Integer.parseInt(temp.nextToken());
            }
            return temp2;
        } catch (Exception e) {
        }
        return null;
    }
    
    public static Long[] getLongArr() {
        try {
            StringTokenizer temp = new StringTokenizer(br.readLine());
            int n = temp.countTokens();
            Long temp2[] = new Long[n];
            for (int i = 0; i < n; i++) {
                temp2[i] = Long.parseLong(temp.nextToken());
            }
            return temp2;
        } catch (Exception e) {
        }
        return null;
    }
    
    public static String[] getStringArr() {
        try {
            StringTokenizer temp = new StringTokenizer(br.readLine());
            int n = temp.countTokens();
            String temp2[] = new String[n];
            for (int i = 0; i < n; i++) {
                temp2[i] = (temp.nextToken());
            }
            return temp2;
        } catch (Exception e) {
        }
        return null;
    }
    
    public static void print(Object a) {
        out.println(a);
    }
    
    public static void print(String s, Object... a) {
        out.printf(s, a);
    }
    
    public static int nextInt() {
        return sc.nextInt();
    }
    
    public static double nextDouble() {
        return sc.nextDouble();
    }
    
    public static void main(String[] ar) {
        initA();
        cf469c c = new cf469c();
        c.solve();
        out.flush();
    }
    
    void solve() {
        int n = getInt();
        if (n < 4) {
            print("NO");
            return;          
        }
        if(n >= 4 && (n-4)%4==0){
            print("YES");
            print("4 * 3 = 12");
            print("12 * 1 = 12");
            print("12 * 2 = 24");
            for(int i = n;i>4;i-=4){
                int x = 24 - i;
                print("24 - "+i +" = "+x);
                int y = x + (i-1);
                print(x+" + "+(i-1)+" = "+y);
                int z = y + (i-2);                
                print(y+" + "+(i-2)+" = "+z);
                int a = z - (i-3);
                print(z+" - "+(i-3)+" = "+a);
            }
            return;
        }        
        if(n >= 5 && (n-5)%4==0){
            print("YES");
            print("5 * 4 = 20");
            print("3 + 2 = 5");
            print("20 + 5 = 25");
            print("25 - 1 = 24");
            
            for(int i = n;i>5;i-=4){
                int x = 24 - i;
                print("24 - "+i +" = "+x);
                int y = x + (i-1);
                print(x+" + "+(i-1)+" = "+y);
                int z = y + (i-2);                
                print(y+" + "+(i-2)+" = "+z);
                int a = z - (i-3);
                print(z+" - "+(i-3)+" = "+a);
            }
            return;
        }
        if(n >= 6 && (n-6)%4==0) {
            print("YES");
            print("6 + 1 = 7");
            print("5 * 3 = 15");
            print("4 - 2 = 2");
            print("7 + 15 = 22");
            print("22 + 2 = 24");
            
            for(int i = n;i>6;i-=4){
                int x = 24 - i;
                print("24 - "+i +" = "+x);
                int y = x + (i-1);
                print(x+" + "+(i-1)+" = "+y);
                int z = y + (i-2);                
                print(y+" + "+(i-2)+" = "+z);
                int a = z - (i-3);
                print(z+" - "+(i-3)+" = "+a);
            }
            return;
        }
        if(n >= 7 && (n-7)%4==0){
            print("YES");
            print("6 * 4 = 24");
            print("2 - 1 = 1");
            print("24 - 1 = 23");
            print("23 + 3 = 26");          
            print("7 - 5 = 2");
            print("26 - 2 = 24");            
            for(int i = n;i>7;i-=4){
                int x = 24 - i;
                print("24 - "+i +" = "+x);
                int y = x + (i-1);
                print(x+" + "+(i-1)+" = "+y);
                int z = y + (i-2);                
                print(y+" + "+(i-2)+" = "+z);
                int a = z - (i-3);
                print(z+" - "+(i-3)+" = "+a);
            }
            return;
        }
    }
}