import std.algorithm;
import std.array;
import std.ascii;
import std.bigint;
import std.complex;
import std.container;
import std.conv;
import std.functional;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

auto readInts() {
	return array(map!(to!int)(readln().strip().split()));
}
auto readInt() {
	return readInts()[0];
}
auto readLongs() {
	return array(map!(to!long)(readln().strip().split()));
}
auto readLong() {
	return readLongs()[0];
}

void readlnTo(T...)(ref T t) {
    auto s = readln().split();
    assert(s.length == t.length);
    foreach(ref ti; t) {
        ti = s[0].to!(typeof(ti));
        s = s[1..$];
    }
}

const real eps = 1e-10;

const long p = 1_000_000_000 + 7;


void main(){
    while(true) {
        auto n = readInt();
        if(n == 0) {
            return;
        }
        auto block = new bool[][](5001, 5);
        foreach(i; iota(n)) {
            int d, p, q;
            readlnTo(d, p, q);
            --q;
            int l = -1;
            foreach(j; iota(q, q + (d == 1 ? p: 1))) {
                foreach(k; iota(5000)) {
                    if(block[k][j]) {
                        l = max(l, k);
                    }
                }
            }
            foreach(j; iota(p)) {
                if(d == 1) {
                    block[l+1][q+j] = true;
                } else {
                    block[l+1+j][q] = true;
                }
            }
            foreach(j; iota(p).retro) {
                if(block[l+1+j].all!(x => x)) {
                    foreach(k; iota(l+1+j, 5000)) {
                        foreach(m; iota(5)) {
                            block[k][m] = block[k+1][m];
                        }
                    }
                }
            }
        }
        writeln(block.map!(a => a.count!(x => x)).sum);
    }
}