/*テ」ツ?禿」ツつ古」ツ?ッTERODES
  Sample1:
  9
  1 1 1
  1 2 1
  1 3 1
  1 4 1
  1 3 1
  1 2 1
  1 1 1
  2 5 5
  2 5 4
  0
  Output:
  11

  Sample2:
  10
  1 4 1
  1 1 1
  1 4 1
  1 1 2
  1 4 1
  1 1 3
  1 4 1
  1 1 4
  2 5 5
  2 5 5
  0
  Output:
  10



4444.    44445     .....        .....
.3... -> .3..5 ->  .....    NOT .....
2222.    22225     .3...        .....
1....    1...5     1....        13...

*/

#include<iostream>
#include<algorithm>
#include<vector>
#include<cassert>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define inf (1<<28)
 
using namespace std;
typedef pair<int,int> ii;
int field[5010][5];
int top[5];
int n,d,p,q;
vector<ii> input;
 
bool checkX(int y)
{
  rep(x,5)if(!field[y][x])return false;
  return true;
}
 
void updateD(int x,int y)
{
  ii info = input[field[y][x]];
  if(info.first == 1)
    {//yoko
      //while(true)//テ」ツ?禿」ツ?禿」ツ?ョwhileテ」ツつ津」ツつづ」ツ?ゥテ」ツ?崚」ツ?ーテ」ツ?、テ」ツ?」テ」ツ?凝」ツ?凝」ツつ凝」ツ?セテ」ツ?ァティツ青ステ」ツ?。テ」ツつ?
      //{
      bool check = true;
      rep(i,5)
        {
          if(field[y][x] != field[y][i])continue;
          if(y-1 >= 0 && field[y-1][i] != 0)
	    {
	      check = false;
	      break;
	    }
        }
      if(!check)return;
      int v = field[y][x];
      rep(i,5)
        {
          if(v != field[y][i])continue;
          assert(field[y-1][i] == 0);
          field[y-1][i] = field[y][i];
          field[y][i] = 0;
        }
      y = y-1;
      if(y <= 0)return;
      //}
    }
  else
    {
      int v = field[y][x];
     
      int bot = 0;
      int py = y;
      while(py-1 >= 0 && field[py-1][x] == 0)py--;
      bot = y-py;
 
      if(bot == 0)return;
      bot = 1;//テ」ツ?禿」ツ?禿」ツつ鍛otテ」ツ?ョテ」ツ?セテ」ツ?セテ」ツ?ォテ」ツ?凖」ツつ古」ツ?ーテ」ツ?、テ」ツ?」テ」ツ?凝」ツ?凝」ツつ凝」ツ?セテ」ツ?ァテ」ツ?甘」ツ?。テ」ツつ?
      while(v == field[y][x])
	{
	  assert(y-bot >= 0);
	  assert(field[y-bot][x] == 0);
	  field[y-bot][x] = field[y][x];
	  field[y][x] = 0;
	  y++;
	}
     
    }
}
 
int main()
{
  while(cin >> n,n)
    {
      input.clear();
      input.resize(1010,ii(-1,-1));
      rep(i,5010)rep(j,5)field[i][j] = 0;
      rep(i,5)top[i] = 0;
      REP(i,1,n+1)
	{
	  cin >> d >> p >> q;
	  if(d == 1 && p == 5)continue;
	  q--;
	  input[i] = ii(d,p);
	  int cyb,cyt;
	  if(d == 2)
	    {
	      cyb = top[q],cyt = top[q]+p;
	      REP(j,top[q],top[q]+p)field[j][q] = i;
	      top[q] += p;
	    }
	  else
	    {
	      int mexico = -inf;
	      REP(j,q,q+p)mexico = max(mexico,top[j]);
	      REP(j,q,q+p)field[mexico][j] = i;
	      cyb = cyt = mexico;
	      REP(j,q,q+p)top[j] = mexico+1;
	    }
 
      bool update = true;
      while(update)
	{
	  update = false;
	  vector<int> erasedY;
	  REP(y,cyb,cyt+1)
	    {
	      if(checkX(y))
		{
		  update = true;
		  erasedY.push_back(y);
		  rep(x,5)field[y][x] = 0;
		}
	    }
 
	  //down
	  if(!erasedY.empty())
	    {
 
 
	      int yt = 0;
	      rep(j,5)yt = max(yt,top[j]);
	      rep(j,erasedY.size())
		{
		  REP(y,erasedY[j],yt)
		    {
		      int pre = -1;
		      rep(x,5)
			{
			  if(field[y][x] == pre)continue;
			  if(field[y][x] == 0 || y-1 < 0)continue;
 
			  pre = field[y][x];
			  updateD(x,y);
			}
		    }
		}
 
 
	    }
      
	  //update top
	  rep(j,5)
	    {
	      int y = top[j];
	      while(y >= 0 && field[y][j] == 0)y--;
	      top[j] = y+1;
	    }
      
	}
    }

      int yt = 0;
      rep(i,5)yt = max(yt,top[i]);
      int ans = 0;
      rep(y,yt)
	rep(x,5)
	if(field[y][x] != 0)ans++;    
      cout << ans << endl;
    }
  return 0;
}

Measured memory_bytes: 1316