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
from math import ceil
from math import floor	
from math import sqrt
from math import log

prime = pow(10, 9) + 7

def mod_expo(n, p, m):
	"""find (n^p)%m"""
	result = 1
	while p != 0:
		if p%2 == 1:
			result = (result * n)%m
		p //= 2
		n = (n * n)%m
	return result
	
def find_sequences(n):
	result = []
	if n <= 3:
		return result
	while n > 5:
		result.append("24 * 1 = 24")
		result.append(str(n) + " - " + str(n-1) + " = 1")
		n -= 2
	result.reverse()
	if n == 4:
		result.insert(0, "1 + 2 = 3")
		result.insert(1, "3 + 3 = 6")
		result.insert(2, "4 * 6 = 24")
	elif n == 5:
		result.insert(0, "1 + 4 = 5")
		result.insert(1, "5 * 5 = 25")
		result.insert(2, "25 - 3 = 22")
		result.insert(3, "22 + 2 = 24")
	return result
	
def check(n, k):
	v = 0
	left = n
	while left > 0:
		current = min(left, k)
		v += current
		left -= current
		left -= left//10
	return (2*v >= n)	
	
def get_pair_count(n, arr):
	count = 0
	mp = {}
	for i in range(n):
		if arr[i] not in mp:
			mp[arr[i]] = 0
		mp[arr[i]] += 1 
	for i in range(n):
		for deg in range(1, 31):
			val = pow(2, deg) - arr[i] 
			if val in mp:
				count += mp[val]
				if val == arr[i]:
					count -= 1
		mp[arr[i]] -= 1
				
	return count

def find_bsearch(n):
	left = 1
	right = n
	middle = 0
	if n <= 2:
		return 1
	while left < right:
		#if (middle == int((left + right)/2)):
		#	right = middle
		middle = left + (right - left)//2
		#print(left, middle, right)
		if check(n, middle):
			if middle == left or not check(n, middle-1):
				return middle
			right = middle-1
		else:
			left = middle+1
	return left	
		
def find_divisors(x):
	divisors = []
	for i in range(2, int(sqrt(x))+1):
		if x%i == 0:
			if x == i * i:
				divisors.append(i)
			else:
				divisors.append(i)
				divisors.append(int(x/i))
	
	return divisors

def find_min(N, d):
	N = str(N)
	d = str(d)
	for i in range(len(N)-1, -1):
		print(N[i])
		if int(N[i]) > int(d):
			N = ''.join([N[j] for j in range(len(N)) and j != i])
			N += d
	return N  

t=1
# t=int(input())
while t:
	t = t - 1
	count=0
	#n, m, x, y = map(int, input().split())
	# n, X = map(int, input().split())
	# text = input()
	n = int(input())
	#arr = list(map(int, input().strip().split()))[:n]
	# b = list(map(int, input().strip().split()))[:n]
	#N = input()
	# below = input()
	#n, X = map(int, input().split())
	#a2, b2 = map(int, input().split())
	
	# print(a + g)
	
	# print(ffin(n, arr, b))
	#if is_possible(n, m , x, y):
	 #	print("Chefirnemo")
	#else:
	#	print("Pofik")
	answers = find_sequences(n)
	if len(answers):
		print("YES")
		for answer in answers:
			print(answer)
	else:
		print("NO")

	
