#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& a) {
  in >> a.first >> a.second;
  return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {
  out << a.first << " " << a.second;
  return out;
}
template <typename T, typename T1>
T amax(T& a, T1 b) {
  if (b > a) a = b;
  return a;
}
template <typename T, typename T1>
T amin(T& a, T1 b) {
  if (b < a) a = b;
  return a;
}
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const int32_t MM = 998244353;
const long long N = 2e5 + 5;
string s[N];
long long p[N];
long long m[N];
long long mch[N];
void solve() {
  set<long long, greater<long long> > ids;
  long long n;
  cin >> n;
  for (long long i = 0; i < 2 * n; i++) {
    cin >> s[i];
    if (s[i] == "-") {
      cin >> p[i];
      m[p[i]] = i;
    } else {
      ids.insert(i);
    }
  }
  for (long long i = 1; i < n + 1; i++) {
    if (ids.upper_bound(m[i]) == ids.end()) {
      cout << "NO\n";
      return;
    }
    long long tmp = *ids.upper_bound(m[i]);
    mch[i] = tmp;
    ids.erase(tmp);
    p[tmp] = i;
  }
  set<long long> vals;
  for (long long i = 0; i < 2 * n; i++) {
    if (s[i] == "+") {
      vals.insert(p[i]);
    } else {
      long long tmp = *vals.begin();
      vals.erase(tmp);
      if (p[i] != tmp) {
        cout << "NO\n";
        return;
      }
    }
  }
  cout << "YES\n";
  for (long long i = 0; i < 2 * n; i++) {
    if (s[i] == "+") {
      cout << p[i] << " ";
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
