#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(char c) {
  string s;
  s += c;
  return s;
}
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "1" : "0"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (long long i = 0; i < static_cast<long long>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
void Clearing_out() { return; }
template <typename Head, typename... Tail>
void Clearing_out(Head& H, Tail&... T) {
  H.clear();
  Clearing_out(T...);
}
void testcase() {
  long long n;
  cin >> n;
  vector<long long> collection;
  vector<pair<char, long long>> q(2 * n);
  for (long long i = 0; i < 2 * n; i++) {
    cin >> q[i].first;
    if (q[i].first == '-') cin >> q[i].second;
  }
  if (q[2 * n - 1].first == '+') {
    cout << "NO\n";
    return;
  }
  vector<long long> ans(n);
  long long j = n - 1;
  collection.push_back(q[2 * n - 1].second);
  for (long long i = 2 * n - 2; i >= 0; i--) {
    if (q[i].first == '+') {
      if (collection.empty()) {
        cout << "NO\n";
        return;
      }
      ans[j--] = collection.back();
      collection.pop_back();
    } else {
      if (!collection.empty() && collection.back() < q[i].second) {
        cout << "NO\n";
        return;
      }
      collection.push_back(q[i].second);
    }
  }
  if (!collection.empty()) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
    for (auto i : ans) cout << i << " ";
    cout << '\n';
  }
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long tt = 1;
  while (tt--) {
    testcase();
  }
  return 0;
}
