codeforce #420

C. Okabe and Boxes

time limit per test : 3 seconds    
memory limit per test : 256 megabytes

Okabe and Super Hacker Daru are stacking and removing boxes. There are n boxes numbered from 1 to n. Initially there are no boxes on the stack.

Okabe, being a control freak, gives Daru 2n commands:n of which are to add a box to the top of the stack, andn of which are to remove a box from the top of the stack and throw it in the trash. Okabe wants Daru to throw away the boxes in the order from1 to n. Of course, this means that it might be impossible for Daru to perform some of Okabe'sremove commands, because the required box is not on the top of the stack.

That's why Daru can decide to wait until Okabe looks away and then reorder the boxes in the stack in any way he wants. He can do it at any point of time between Okabe's commands, but he can't add or remove boxes while he does it.

Tell Daru the minimum number of times he needs to reorder the boxes so that he can successfully complete all of Okabe's commands. It is guaranteed that every box is added before it is required to be removed.

Input

The first line of input contains the integer n (1 ≤ n ≤ 3·10⁵) — the number of boxes.

Each of the next 2n lines of input starts with a string "add" or "remove". If the line starts with the "add", an integer x (1 ≤ x ≤ n) follows, indicating that Daru should add the box with numberx to the top of the stack.

It is guaranteed that exactly n lines contain "add" operations, all the boxes added are distinct, andn lines contain "remove" operations. It is also guaranteed that a box is always added before it is required to be removed.

Output

Print the minimum number of times Daru needs to reorder the boxes to successfully complete all of Okabe's commands.

Examples

Input

3
add 1
remove
add 2
add 3
remove
remove

Output

1

Input

7
add 3
add 2
add 1
remove
add 4
remove
remove
remove
add 6
add 7
add 5
remove
remove
remove

Output

2

Note

In the first sample, Daru should reorder the boxes after adding box 3 to the stack.

In the second sample, Daru should reorder the boxes after adding box 4 and box 7 to the stack.

大致的题意就是执行n次输入输出，使在栈中的数目按照1-n的顺序输出，如果不是按顺序，对当前栈中的数进行排序，使输出符合顺序。问一共需要排序几次。

这个题就是一个简单的模拟题，注意题目是每个remove的数都是存在的，所以用一个栈记录当前没有排序的数字。如果输入remove，符合顺序pop(),否则就清空栈，相当于排序，排序数++。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>

using namespace std;

stack<int> s;

int main()
{
    int n,x;
    char c[10];
    while(scanf("%d",&n)!=EOF)
    {
       int ans=0,cnt=1;
        while(!s.empty()) s.pop();

        for(int i=0;i<2*n;++i)
        {
            getchar();
            scanf("%s",c);
            if(c[0]=='a')
            {
                scanf("%d",&x);
                s.push(x);
            }
            else
            {
                if(!s.empty())
                {
                    if(s.top()!=cnt)
                    {
                        ans++;
                        while(!s.empty()) s.pop();
                    }
                    else
                    {
                        s.pop();
                    }
                }
                cnt++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}