#include <bits/stdc++.h>
template <typename T>
void MACRO_VAR_Scan(T& t) {
  std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First& first, Rest&... rest) {
  std::cin >> first;
  MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
template <typename T>
inline T CHMAX(T& a, const T b) {
  return a = (a < b) ? b : a;
}
template <typename T>
inline T CHMIN(T& a, const T b) {
  return a = (a > b) ? b : a;
}
void CHECKTIME(std::function<void()> f) {
  auto start = std::chrono::system_clock::now();
  f();
  auto end = std::chrono::system_clock::now();
  auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start))
                 .count();
  std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n";
}
template <class T>
std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
  return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template <typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;
constexpr int INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template <class T, size_t N>
void FILL(T (&a)[N], const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, size_t N, size_t M, class T>
void FILL(ARY (&a)[N][M], const T& val) {
  for (auto& b : a) FILL(b, val);
}
template <class T>
void FILL(std::vector<T>& a, const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, class T>
void FILL(std::vector<std::vector<ARY>>& a, const T& val) {
  for (auto& b : a) FILL(b, val);
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  ;
  int n;
  MACRO_VAR_Scan(n);
  ;
  enum TYPE { AND, OR, XOR, NOT, IN };
  struct Node {
    TYPE t;
    int a, b;
  };
  std::vector<Node> node(n);
  for (int i = 0; i < int(n); ++i) {
    std::string s;
    MACRO_VAR_Scan(s);
    ;
    int a;
    MACRO_VAR_Scan(a);
    ;
    int b = 0;
    if (s == "IN" || s == "NOT") {
    } else
      std::cin >> b;
    --a;
    --b;
    TYPE t = IN;
    if (s == "AND")
      t = AND;
    else if (s == "OR")
      t = OR;
    else if (s == "XOR")
      t = XOR;
    else if (s == "NOT")
      t = NOT;
    else if (s == "IN")
      t = IN, ++a;
    node[i] = Node{t, a, b};
  }
  std::vector<std::vector<int>> g(n);
  for (int i = 0; i < int(n); ++i) {
    if (node[i].t == IN) continue;
    g[i].emplace_back(node[i].a);
    if (node[i].b != -1) {
      g[i].emplace_back(node[i].b);
    }
  }
  std::vector<bool> b(n, true);
  {
    std::function<bool(int)> dfs = [&](int v) {
      switch (node[v].t) {
        case AND: {
          b[v] = true;
          b[v] = b[v] & dfs(node[v].a);
          b[v] = b[v] & dfs(node[v].b);
        } break;
        case OR: {
          b[v] = false;
          b[v] = b[v] | dfs(node[v].a);
          b[v] = b[v] | dfs(node[v].b);
        } break;
        case XOR: {
          b[v] = false;
          b[v] = b[v] ^ dfs(node[v].a);
          b[v] = b[v] ^ dfs(node[v].b);
        } break;
        case NOT: {
          b[v] = !dfs(node[v].a);
        } break;
        case IN: {
          b[v] = !!(node[v].a);
        } break;
      }
      return b[v];
    };
    dfs(0);
  }
  std::vector<bool> c(n, true);
  {
    std::function<void(int)> dfs = [&](int v) {
      switch (node[v].t) {
        case AND: {
          c[node[v].a] =
              ((((!b[node[v].a]) & b[node[v].b]) == b[v]) ? b[0] : c[v]);
          c[node[v].b] =
              (((b[node[v].a] & (!b[node[v].b])) == b[v]) ? b[0] : c[v]);
          dfs(node[v].a);
          dfs(node[v].b);
        } break;
        case OR: {
          c[node[v].a] =
              ((((!b[node[v].a]) | b[node[v].b]) == b[v]) ? b[0] : c[v]);
          c[node[v].b] =
              (((b[node[v].a] | (!b[node[v].b])) == b[v]) ? b[0] : c[v]);
          dfs(node[v].a);
          dfs(node[v].b);
        } break;
        case XOR: {
          c[node[v].a] =
              ((((!b[node[v].a]) ^ b[node[v].b]) == b[v]) ? b[0] : c[v]);
          c[node[v].b] =
              (((b[node[v].a] ^ (!b[node[v].b])) == b[v]) ? b[0] : c[v]);
          dfs(node[v].a);
          dfs(node[v].b);
        } break;
        case NOT: {
          c[node[v].a] = c[v];
          dfs(node[v].a);
        } break;
        case IN: {
        } break;
      }
    };
    c[0] = !b[0];
    dfs(0);
  }
  for (int i = 0; i < int(n); ++i) {
    if (node[i].t == IN) {
      std::cout << (c[i]);
      ;
    }
  }
  std::cout << "\n";
  ;
  return 0;
}
