Flexible Segments

아직 제출이 없습니다시간 제한1초메모리 제한512 MB

문제

A great mathematician Vladimir Germanovich has noticed an interesting property of some segments of positive integers while exploring them for new patterns.

Vladimir calls the segment of positive integers l,l+1,,rl, l + 1, \ldots, r flexible if he is able to change every number of this segment by exactly one in such way, that the product of numbers on this segment doesn't change. That is, there exists a sequence a_l,a_l+1,,a_ra\_l, a\_{l+1}, \ldots, a\_r with the following properties:

  • a_k=k±1a\_k = k \pm 1
  • l(l+1)r=a_la_l+1a_rl \cdot (l+1)\cdot \ldots \cdot r = a\_l \cdot a\_{l+1} \cdot \ldots \cdot a\_r

Now Vladimir Germanovich wants to know if he is able to build flexible segment of any length. Given positive integer nn find any flexible segment that consists of nn consecutive positive integers or tell that there is no such segment.

입력

The only line contains an integer nn (1n10,0001 \le n \le 10\\,000) --- the length of required segment.

출력

The first line of output must contain "YES" if there exists a flexible segment of nn positive integers. Otherwise it must contain "NO".

If such segment exists the second and the third lines must contain the description of this segment.

The second line should contain the only integer ll (1l1,000,0001 \le l \le 1\\,000\\,000) --- the first element of this segment. It is guaranteed that if a flexible segment of length nn exists then there exists a flexible segment \[l;r]\[l; r] of length nn such that 1l1,000,0001 \le l \le 1\\,000\\,000.

The third line should contain a string of length nn without spaces. It must consist of "+" and "-" characters, the (kl+1)(k-l+1)-th character of this string should be "-" if a_k=k1a\_k = k - 1, or "+" if a_k=k+1a\_k = k + 1.

힌트

In the second example n=4n = 4, l=2l = 2, r=l+n1=5r = l + n - 1 = 5. The answer is the following: a_2=21=1a\_2 = 2 - 1 = 1, a_3=3+1=4a\_3 = 3 + 1 = 4, a_4=4+1=5a\_4 = 4 + 1 = 5, a_5=5+1=6a\_5 = 5 + 1 = 6. The product of integers from ll to rr is 2345=1202 \cdot 3 \cdot 4 \cdot 5 = 120. The product of a_ka\_k is a_2a_3a_4a_5=1456=120a\_2 \cdot a\_3 \cdot a\_4 \cdot a\_5 = 1 \cdot 4 \cdot 5 \cdot 6 = 120. Thus, the segment \[2;5]\[2; 5] is flexible.