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

Source: codeforces | Difficulty: MEDIUM
Tags: Greedy algorithms

Mathematics

Constructive algorithms


Solutions:
n = int(input())
if n < 4:
	print('NO')
elif n == 4:
	print('YES')
	print('1 * 2 = 2')
	print('2 * 3 = 6')
	print('6 * 4 = 24')
elif n == 5:
	print('YES')
	print('4 * 5 = 20')
	print('3 - 1 = 2')
	print('20 + 2 = 22')
	print('22 + 2 = 24')
else:
	print('YES')
	print('2 * 3 = 6')
	print('6 * 4 = 24')
	print('6 - 1 = 5')
	print('5 - 5 = 0')
	for i in range(7, n + 1):
		print('0 * {} = 0'.format(i))
	print('24 + 0 = 24')


n = int(input())
if n < 4:
	print('NO')
elif n == 4:
	print('YES')
	print('3 * 4 = 12')
	print('2 * 1 = 2')
	print('12 * 2 = 24')
elif n == 5:
	print('YES')
	print('5 - 3 = 2')
	print('2 + 1 = 3')
	print('3 * 4 = 12')
	print('12 * 2 = 24')
else:
	print('YES')
	print(str(n) + ' - ' + str(n - 1) + ' = 1')
	print('1 - 1 = 0')
	for i in range(5, 5 + n - 6):
		print(str(i) + ' * 0 = 0')
	print('2 * 3 = 6')
	print('4 * 6 = 24')
	print('24 + 0 = 24')


n = int(input())
if n < 4:
	print('NO')
else:
	print('YES')
	while n > 5:
		a = str(n)
		b = str(n - 1)
		print(a + ' - ' + b + ' = 1 ')
		print('1 * 1 = 1')
		n -= 2
	if n == 4:
		print('4 * 3 = 12\n12 * 2 = 24\n24 * 1 = 24')
	else:
		print('5 - 2 = 3\n3 - 1 = 2\n2 * 3 = 6\n6 * 4 = 24')


n = int(input())
if n < 4:
	print('NO')
elif n == 5:
	print('YES')
	print('5 * 4 = 20')
	print('20 + 3 = 23')
	print('23 + 2 = 25')
	print('25 - 1 = 24')
elif n == 4:
	print('YES')
	print('1 * 2 = 2')
	print('2 * 3 = 6')
	print('6 * 4 = 24')
elif (n - 4) % 2 == 0:
	print('YES')
	for i in range(n, 4, -2):
		print('%s - %s = %s' % (i, i - 1, 1))
	print('1 * 2 = 2')
	print('2 * 3 = 6')
	print('6 * 4 = 24')
	for i in range(n, 4, -2):
		print('1 * 24 = 24')
else:
	print('YES')
	print('%s - 1 = %s' % (n, n - 1))
	print('%s - %s = 0' % (n - 1, n - 1))
	for i in range(n - 2, 4, -1):
		print('%s * 0 = 0' % i)
	print('2 * 3 = 6')
	print('6 * 4 = 24')
	print('24 + 0 = 24')


n = int(input())
if n == 1 or n == 2 or n == 3:
	print('NO')
	exit(0)
else:
	print('YES')
	if n % 2 == 0:
		print('1 * 2 = 2')
		print('2 * 3 = 6')
		print('6 * 4 = 24')
		for i in range(5, n + 1, 2):
			print(i + 1, '-', i, '= 1')
		for i in range((n - 4) // 2):
			print('24 * 1 = 24')
	else:
		print('5 - 2 = 3')
		print('3 - 1 = 2')
		print('2 * 3 = 6')
		print('6 * 4 = 24')
		for i in range(6, n + 1, 2):
			print(i + 1, '-', i, '= 1')
		for i in range((n - 5) // 2):
			print('24 * 1 = 24')


from collections import *
import os, sys
from io import BytesIO, IOBase

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
BUFSIZE = 8192
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
rstr = lambda : input().strip()
rstrs = lambda : [str(x) for x in input().split()]
rstr_2d = lambda n: [rstr() for _ in range(n)]
rint = lambda : int(input())
rints = lambda : [int(x) for x in input().split()]
rint_2d = lambda n: [rint() for _ in range(n)]
rints_2d = lambda n: [rints() for _ in range(n)]
ceil1 = lambda a, b: (a + b - 1) // b
n = rint()
if n < 4:
	exit(print('NO'))
print('YES')
if n & 1:
	print('1 + 5 = 6\n3 - 2 = 1\n 1 * 4 = 4\n4 * 6 = 24')
	for i in range(6, n, 2):
		print(f'{i + 1} - {i} = 1\n24 * 1 = 24')
else:
	cur = 1
	for i in range(1, 4):
		print(f'{cur} * {i + 1} = {cur * (i + 1)}')
		cur *= i + 1
	for i in range(5, n, 2):
		print(f'{i + 1} - {i} = 1\n24 * 1 = 24')


def logs(n):
	if n == 4:
		return [(1, 1, 2), (1, 2, 3), (1, 6, 4)]
	if n == 5:
		return [(2, 5, 4), (2, 9, 3), (1, 12, 2), (1, 24, 1)]
	ans = [(3, i + 1, i) for i in range(n - 1, 4, -2)]
	ans.extend(logs(4 + n % 2))
	ans += [(1, 24, 1) for i in range(n - 1 - len(ans))]
	return ans
n = int(input())
if n < 4:
	print('NO')
else:
	print('YES')
	for note in logs(n):
		if note[0] == 1:
			print('{0} * {1} = {2}'.format(note[1], note[2], note[1] * note[2]))
		elif note[0] == 2:
			print('{0} + {1} = {2}'.format(note[1], note[2], note[1] + note[2]))
		else:
			print('{0} - {1} = {2}'.format(note[1], note[2], note[1] - note[2]))


n = int(input())
if n < 4:
	print('NO')
elif n & 1:
	print('YES\n5 - 3 = 2\n2 + 1 = 3\n2 * 3 = 6\n4 * 6 = 24')
	for i in range(6, n, 2):
		print(i + 1, '-', i, '=', 1)
		print('24 * 1 = 24')
else:
	print('YES\n1 * 2 = 2\n2 * 3 = 6\n6 * 4 = 24')
	for i in range(5, n, 2):
		print(i + 1, '-', i, '=', 1)
		print('24 * 1 = 24')


n = int(input())
if n >= 4:
	print('YES')
	moves = 0
	for i in range(5 + (0 if n % 2 == 0 else 1), n, 2):
		print(str(i + 1) + ' - ' + str(i) + ' = ' + str(1))
		moves += 1
	if n % 2 == 0:
		print('2 * 3 = 6')
		print('6 * 4 = 24')
		moves += 2
	else:
		print('2 + 1 = 3')
		print('5 - 3 = 2')
		print('3 * 2 = 6')
		print('6 * 4 = 24')
		moves += 4
	while moves < n - 1:
		moves += 1
		print('1 * 24 = 24')
else:
	print('NO')


from sys import stdin, stdout
from math import ceil, floor

def solve1(x):
	b = x
	a = x - 1
	k = 0
	for i in range(x - 1):
		if x & 1 == 0:
			if a == 4 or b == 4:
				break
		elif a == 5 or b == 5:
			break
		stdout.write('%s - %s = %s\n' % (b, a, b - a))
		b -= 2
		a -= 2
		k += 1
	j = k
	for i in range(j):
		if x & 1 == 0:
			stdout.write('%s * %s = %s\n' % (4, 1, 4))
		else:
			stdout.write('%s * %s = %s\n' % (5, 1, 5))
		k += 1
	if x & 1 == 0:
		a = 3
		b = 4
		for i in range(3):
			c = a * b
			stdout.write('%s * %s = %s\n' % (a, b, c))
			a = a - 1
			b = c
			k += 1
	else:
		b = 5
		a = 4
		stdout.write('%s + %s = %s\n' % (b, a, a + b))
		k += 1
		b = 9
		a = 3
		stdout.write('%s * %s = %s\n' % (b, a, b * a))
		k += 1
		b = 27
		a -= 1
		for i in range(2):
			stdout.write('%s - %s = %s\n' % (b, a, b - a))
			k += 1
			b = b - a
			a -= 1

def main():
	n = int(stdin.readline().strip())
	if n <= 3:
		stdout.write('NO\n')
		return
	stdout.write('YES\n')
	solve1(n)
main()


a = int(input())
if a <= 3:
	print('NO')
elif a % 2 == 0:
	print('YES')
	print('4 * 3 = 12')
	print('12 * 2 = 24')
	print('24 * 1 = 24')
	for i in range(6, a + 1, 2):
		print(str(i), '-', str(i - 1), '= 1')
		print('24 * 1 = 24')
elif a % 2 == 1:
	print('YES')
	print('4 - 2 = 2')
	print('2 + 1 = 3')
	print('3 + 5 = 8')
	print('3 * 8 = 24')
	for i in range(7, a + 1, 2):
		print(str(i), '-', str(i - 1), '= 1')
		print('24 * 1 = 24')


import os
import sys
from collections import *
from bisect import *
from io import BytesIO, IOBase

def vsInput():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
ALPHA = 'abcdefghijklmnopqrstuvwxyz'
M = 10 ** 9 + 7
EPS = 1e-06

def Ceil(a, b):
	return a // b + int(a % b > 0)

def value():
	return tuple(map(int, input().split()))

def array():
	return [int(i) for i in input().split()]

def Int():
	return int(input())

def Str():
	return input()

def arrayS():
	return [i for i in input().split()]
n = Int()
if n < 4:
	print('NO')
	exit()
print('YES')
if n == 4:
	print('3 * 4 = 12')
	print('12 * 2 = 24')
	print('24 * 1 = 24')
elif n == 5:
	print('5 * 4 = 20')
	print('2 - 1 = 1')
	print('3 + 1 = 4')
	print('20 + 4 = 24')
else:
	print('3 - 2 = 1')
	print('1 - 1 = 0')
	for i in range(7, n + 1):
		print('{} * 0 = 0'.format(i))
	print('5 * 0 = 0')
	print('4 * 6 = 24')
	print('24 + 0 = 24')