Problem: Implication is a function of two logical arguments, its value is false if and only if the value of the first argument is true and the value of the second argument is false. 

Implication is written by using character '<image>', and the arguments and the result of the implication are written as '0' (false) and '1' (true). According to the definition of the implication: 

<image>

<image>

<image>

<image>

When a logical expression contains multiple implications, then when there are no brackets, it will be calculated from left to fight. For example,

<image>. 

When there are brackets, we first calculate the expression in brackets. For example,

<image>.

For the given logical expression <image> determine if it is possible to place there brackets so that the value of a logical expression is false. If it is possible, your task is to find such an arrangement of brackets.

Input

The first line contains integer n (1 ≤ n ≤ 100 000) — the number of arguments in a logical expression.

The second line contains n numbers a1, a2, ..., an (<image>), which means the values of arguments in the expression in the order they occur.

Output

Print "NO" (without the quotes), if it is impossible to place brackets in the expression so that its value was equal to 0.

Otherwise, print "YES" in the first line and the logical expression with the required arrangement of brackets in the second line.

The expression should only contain characters '0', '1', '-' (character with ASCII code 45), '>' (character with ASCII code 62), '(' and ')'. Characters '-' and '>' can occur in an expression only paired like that: ("->") and represent implication. The total number of logical arguments (i.e. digits '0' and '1') in the expression must be equal to n. The order in which the digits follow in the expression from left to right must coincide with a1, a2, ..., an.

The expression should be correct. More formally, a correct expression is determined as follows:

  * Expressions "0", "1" (without the quotes) are correct. 
  * If v1, v2 are correct, then v1->v2 is a correct expression. 
  * If v is a correct expression, then (v) is a correct expression. 



The total number of characters in the resulting expression mustn't exceed 106.

If there are multiple possible answers, you are allowed to print any of them.

Examples

Input

4
0 1 1 0


Output

YES
(((0)-&gt;1)-&gt;(1-&gt;0))


Input

2
1 1


Output

NO


Input

1
0


Output

YES
0

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000000 + 7;
int one;
int n;
int a[2000000];
void input() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
    if (a[i]) one = i;
  }
  if (a[n]) {
    puts("NO");
    exit(0);
  }
  if (n == 1) {
    puts("YES");
    puts("0");
    exit(0);
  }
  if (n == 2) {
    if (!one) {
      puts("NO");
      exit(0);
    }
    puts("YES");
    puts("1->0");
    exit(0);
  }
  if (n == one + 2) {
    for (one = 1; one <= n; one++)
      if (!a[one]) break;
    if (one == n - 1) {
      puts("NO");
      exit(0);
    }
    one = n - 2;
  }
  puts("YES");
}
int st, en;
char s[2000000];
void solve() {
  st = 1000000;
  en = st - 1;
  for (int i = n - 2; i >= 1; i--) {
    if (i == n - 2) {
      s[++en] = a[n - 2] + '0';
      s[++en] = '-';
      s[++en] = '>';
      s[++en] = a[n - 1] + '0';
    } else {
      s[--st] = '>';
      s[--st] = '-';
      s[--st] = a[i] + '0';
    }
    s[--st] = '(';
    s[++en] = ')';
  }
  s[++en] = '-';
  s[++en] = '>';
  s[++en] = '0';
  s[++en] = 0;
  puts(s + st);
}
int main() {
  input();
  solve();
  return 0;
}