#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

template< typename T >
struct edge {
  int src, to;
  T cost;

  edge(int to, T cost) : src(-1), to(to), cost(cost) {}

  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

  edge &operator=(const int &x) {
    to = x;
    return *this;
  }

  operator int() const { return to; }
};

template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;

template< typename G >
struct StronglyConnectedComponents {
  const G &g;
  UnWeightedGraph gg, rg;
  vector< int > comp, order, used;

  StronglyConnectedComponents(G &g) : g(g), gg(g.size()), rg(g.size()), comp(g.size(), -1), used(g.size()) {
    for(int i = 0; i < g.size(); i++) {
      for(auto e : g[i]) {
        gg[i].emplace_back((int) e);
        rg[(int) e].emplace_back(i);
      }
    }
  }

  int operator[](int k) {
    return comp[k];
  }

  void dfs(int idx) {
    if(used[idx]) return;
    used[idx] = true;
    for(int to : gg[idx]) dfs(to);
    order.push_back(idx);
  }

  void rdfs(int idx, int cnt) {
    if(comp[idx] != -1) return;
    comp[idx] = cnt;
    for(int to : rg[idx]) rdfs(to, cnt);
  }

  void build(UnWeightedGraph &t) {
    for(int i = 0; i < gg.size(); i++) dfs(i);
    reverse(begin(order), end(order));
    int ptr = 0;
    for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;

    t.resize(ptr);
    for(int i = 0; i < g.size(); i++) {
      for(auto &to : g[i]) {
        int x = comp[i], y = comp[to];
        if(x == y) continue;
        t[x].push_back(y);
      }
    }
  }
};


int main() {
  int N;
  cin >> N;
  vector< int > A(N), B(N), C(N);
  for(int i = 0; i < N; i++) {
    cin >> A[i] >> B[i] >> C[i];
  }

  vector< int > xs;
  for(int i = 0; i < N; i++) {
    xs.emplace_back(A[i]);
    xs.emplace_back(B[i] - C[i]);
  }
  sort(begin(xs), end(xs));
  xs.erase(unique(begin(xs), end(xs)), end(xs));
  int M = (int) xs.size();

  WeightedGraph< int64 > g(M + N);
  for(int i = 1; i < xs.size(); i++) {
    g[i].emplace_back(i - 1, 0);
  }
  for(int i = 0; i < N; i++) {
    {
      int p = lower_bound(begin(xs), end(xs), B[i] - C[i]) - begin(xs);
      g[M + i].emplace_back(p, B[i]);
    }
    {
      int p = lower_bound(begin(xs), end(xs), A[i]) - begin(xs);
      g[p].emplace_back(M + i, 0);
    }
  }

  StronglyConnectedComponents< WeightedGraph< int64 > > scc(g);
  UnWeightedGraph t;
  scc.build(t);

  auto dp = make_v< int64 >(t.size());
  fill_v(dp, -1);
  vector< int64 > sz(t.size());
  map< int, int > mx[404040];
  for(int i = 0; i < N; i++) {
    sz[scc[i + M]]++;
    {
      int p = lower_bound(begin(xs), end(xs), B[i] - C[i]) - begin(xs);
      chmax(mx[scc[i + M]][scc[p]], B[i]);
    }
  }


  auto dfs = MFP([&](auto dfs, int idx) -> int64 {
    if(~dp[idx]) return dp[idx];
    int64 ret = 0;
    for(auto &to : t[idx]) chmax(ret, dfs(to) + mx[idx][to]);
    ret += mx[idx][idx];
    if(sz[idx] >= 2) ret = infll;
    return dp[idx] = min(ret, infll);
  });

  for(int i = 0; i < N; i++) {
    auto ret = dfs(scc[M + i]);
    if(ret >= infll) cout << "BAN" << endl;
    else cout << ret << endl;
  }

  // A[j] <= B[i]-C[i] なら i->j に有向辺を張る
  // 閉路にぶつかればBAN
  // 但し自分自身には行けません
  // 倍長して適当にやる
  // ぶつからなければ普通にmaxをとります

}