Educational Codeforces Round 27- D Driving Test

D. Driving Test

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarp has just attempted to pass the driving test. He ran over the straight road with the signs of four types.

• speed limit: this sign comes with a positive integer number — maximal speed of the car after the sign (cancel the action of the previous sign of this type); 
• overtake is allowed: this sign means that after some car meets it, it can overtake any other car; 
• no speed limit: this sign cancels speed limit if any (car can move with arbitrary speed after this sign); 
• no overtake allowed: some car can't overtake any other car after this sign. 

Polycarp goes past the signs consequentially, each new sign cancels the action of all the previous signs of it's kind (speed limit/overtake). It is possible that two or more "no overtake allowed" signs go one after another with zero "overtake is allowed" signs between them. It works with "no speed limit" and "overtake is allowed" signs as well.

In the beginning of the ride overtake is allowed and there is no speed limit.

You are given the sequence of events in chronological order — events which happened to Polycarp during the ride. There are events of following types:

1. Polycarp changes the speed of his car to specified (this event comes with a positive integer number); 
2. Polycarp's car overtakes the other car; 
3. Polycarp's car goes past the "speed limit" sign (this sign comes with a positive integer); 
4. Polycarp's car goes past the "overtake is allowed" sign; 
5. Polycarp's car goes past the "no speed limit"; 
6. Polycarp's car goes past the "no overtake allowed"; 

It is guaranteed that the first event in chronological order is the event of type 1 (Polycarp changed the speed of his car to specified).

After the exam Polycarp can justify his rule violations by telling the driving instructor that he just didn't notice some of the signs. What is the minimal number of signs Polycarp should say he didn't notice, so that he would make no rule violations from his point of view?

Input

The first line contains one integer number n (1 ≤ n ≤ 2·105) — number of events.

Each of the next n lines starts with integer t (1 ≤ t ≤ 6) — the type of the event.

An integer s (1 ≤ s ≤ 300) follows in the query of the first and the third type (if it is the query of first type, then it's new speed of Polycarp's car, if it is the query of third type, then it's new speed limit).

It is guaranteed that the first event in chronological order is the event of type 1 (Polycarp changed the speed of his car to specified).

Output

Print the minimal number of road signs Polycarp should say he didn't notice, so that he would make no rule violations from his point of view.

Examples

input

11
1 100
3 70
4
2
3 120
5
3 120
6
1 150
4
3 300

output

2

input

5
1 100
3 200
2
4
5

output

0

input

7
1 20
2
6
4
6
6
2

output

2

Note

In the first example Polycarp should say he didn't notice the "speed limit" sign with the limit of 70 and the second "speed limit" sign with the limit of 120.

In the second example Polycarp didn't make any rule violation.

In the third example Polycarp should say he didn't notice both "no overtake allowed" that came after "overtake is allowed" sign.

题意：

有4种牌子，3-限制速度，4-可以超车，5-无限制速度，6-不可以超车。

3 5作用不会重叠，比如3之后有个5，那就不用看3.

4 5也一样。

POINT：

主要题意没读清。用栈就行了，也是水题。

#include <iostream>
#include <string.h>
#include <stack>
#include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
#define  LL long long
int main()
{
    stack<int>q;
    q.push(1000);
    int n,ans=0;
    scanf("%d",&n);
    int cnt=0;
    int cur=0;
    for(int i=1;i<=n;i++)
    {
        int k;scanf("%d",&k);
        int s;
        if(k==1||k==3)
        {
            scanf("%d",&s);
        }
        if(k==1)
        {
            cur=s;
            while(q.top()<cur)
            {
                ans++;
                q.pop();
            }
        }
        else if(k==2)
        {
            ans+=cnt;
            cnt=0;
        }
        else if(k==3)
        {
            if(cur>s)
                ans++;
            else
                q.push(s);
        }
        else if(k==4)
        {
            cnt=0;
        }
        else if(k==5)
        {
            q.push(1000);
        }
        else
            cnt++;
    }
    printf("%d\n",ans);
}