#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, tsp = 0, i, k, c = 0;
  char A[100005], S[1000000];
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> A[i];
  }
  if (A[n - 1] == '1')
    cout << "NO" << endl;
  else {
    if (n == 1)
      cout << "YES" << endl << 0 << endl;
    else {
      if (n == 2) {
        if (A[0] == '0')
          cout << "NO" << endl;
        else
          cout << "YES" << endl << "1->0" << endl;
      } else {
        for (i = 0; i < n - 2; i++) {
          if (A[i] == '0') {
            tsp = 1;
            break;
          }
        }
        if (tsp == 0 && A[n - 2] == '0')
          cout << "NO" << endl;
        else {
          cout << "YES" << endl;
          S[0] = '0';
          S[1] = '>';
          S[2] = '-';
          if (A[n - 2] == '1') {
            S[3] = '1';
            k = 4;
            for (i = 0; i < n - 2; i++) {
              S[k] = '>';
              S[k + 1] = '-';
              S[k + 2] = A[n - i - 3];
              k += 3;
            }
            for (i = 1; i <= k; i++) {
              cout << S[k - i];
            }
            cout << endl;
          } else {
            if (A[n - 3] == '0') {
              S[3] = ')';
              S[4] = '0';
              S[5] = '>';
              S[6] = '-';
              S[7] = '0';
              S[8] = '(';
              k = 9;
              for (i = 0; i < n - 3; i++) {
                S[k] = '>';
                S[k + 1] = '-';
                S[k + 2] = A[n - i - 4];
                k += 3;
              }
              for (i = 1; i <= k; i++) {
                cout << S[k - i];
              }
              cout << endl;
            } else {
              i = 3;
              S[3] = ')';
              S[4] = ')';
              S[5] = '0';
              k = 6;
              while (A[n - i] == '1') {
                S[k] = '>';
                S[k + 1] = '-';
                S[k + 2] = A[n - i];
                k += 3;
                c++;
                i++;
              }
              S[k] = '(';
              S[k + 1] = '>';
              S[k + 2] = '-';
              S[k + 3] = '0';
              S[k + 4] = '(';
              k += 5;
              n -= (3 + c);
              for (i = 0; i < n; i++) {
                S[k] = '>';
                S[k + 1] = '-';
                S[k + 2] = A[n - i - 1];
                k += 3;
              }
              for (i = 1; i <= k; i++) {
                cout << S[k - i];
              }
              cout << endl;
            }
          }
        }
      }
    }
  }
  return 0;
}
