#include <bits/stdc++.h>
using namespace std;
double PI = acos(-1.0);
long long mod = 1e9 + 7;
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long GCD(long long a, long long b) {
  if (b == 0) return a;
  return GCD(b, a % b);
}
long long prod(long long a, long long b) {
  long long res = 0;
  a %= mod;
  while (b) {
    if (b & 1ll) res = (res + a) % mod;
    a = (2ll * a) % mod;
    b >>= 1ll;
  }
  return res;
}
long long power(long long a, long long b) {
  long long res = 1ll;
  while (b > 0) {
    if (b % 2ll) res = (res * a) % mod;
    a = (a * a) % mod;
    b /= 2ll;
  }
  return res;
}
long long binaryExponentiation(long long a, long long b) {
  long long result = 1ll;
  while (b > 0) {
    if (b % 2 == 1) result = (result * a) % mod;
    a = (a * a) % mod;
    b /= 2ll;
  }
  return result;
}
long long ModularInverse(long long a) {
  return binaryExponentiation(a, mod - 2);
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> a(2 * n);
  for (long long i = 0; i < 2 * n; i++) {
    long long x;
    char c;
    cin >> c;
    if (c == '+') {
      a[i] = 1;
    } else {
      cin >> x;
      a[i] = -x;
    }
  }
  long long t = 0;
  for (long long i = 0; i < 2 * n; i++) {
    if (a[i] > 0) {
      t++;
    } else
      t--;
    if (t < 0) {
      cout << "NO"
           << "\n";
      return;
    }
    if (i > 0 and a[i] < 0 and a[i - 1] < 0 and a[i] > a[i - 1]) {
      cout << "NO"
           << "\n";
      return;
    }
  }
  vector<bool> vis(n + 1, false);
  vector<long long> ans;
  priority_queue<long long, vector<long long>, greater<long long>> pq, ch;
  for (long long i = 2 * n - 1; i >= 0; i--) {
    if (a[i] < 0) {
      pq.push(-a[i]);
    } else {
      ans.push_back(pq.top());
      pq.pop();
    }
  }
  reverse((ans).begin(), (ans).end());
  long long j = 0;
  for (long long i = 0; i < 2 * n; i++) {
    if (a[i] > 0) {
      ch.push(ans[j++]);
    } else {
      long long x = ch.top(), y = -a[i];
      ch.pop();
      if (x != y) {
        cout << "NO"
             << "\n";
        return;
      }
    }
  }
  cout << "YES"
       << "\n";
  for (auto &e : ans) {
    cout << e << " ";
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
}
