g namespace std;
struct node {
	string name;
	int marks;
	node* tiep;
};
struct List {
	node* dau;
	node* cuoi;
};

void InsertFirst(List& l, string vname, int vmarks)
{ 
    node* p = new node;
	p->marks = vmarks;
	p->name = vname;
	p->tiep = NULL;
	if (l.dau == NULL)
		l.dau = l.cuoi = p;
	else
	{
		p->tiep = l.dau;
		l.dau = p;	
	}
}
void InsertLast(list& l, string vname, int vmarks)
{
	node* p = new node;
	p->marks = vmarks;
	p->name = vname;
	p->pNext = NULL;
	if (l.dau == NULL)
	{
		l.dau = l.cuoi = p;
	}
	else
	{
		l.cuoi->pNext = p;
		l.cuoi = p;
	}

}
int Count(List l, int vmarks)
{
	int dem = 0;
	for (node* k = l.dau; k != NULL; k = k->pNext)
	{
		if (k->marks >= vmarks)
			dem++;
	}
	return dem;
}
void XuatList(List l)
{
	for (Node* k = l.dau; k != NULL; k = k->pNext)
	{
		cout << k->name << "  " << k->marks;
	}
}
void menu(list &l){
	while (true)
	{
		string s; 
		cin >> s;
		if (s == "insF")
		{
			string vname;
			cin >> vname;
			int vmark;
			cin >> vmark;	
			InsertFirst(l, vname, vmark);
		}
		else if (s == "insL")
		{
			string vname;
			cin >> vname;
			int vmark;
			cin >> vmark;

			InsertLast(l, vname, vmark);
		}
		else if (s == "count")
		{
			int vmark;
			cin >> vmark;
			int dem = Count(l, vmark);
			cout << dem << endl;
		}	else if (s == "fin")
			break;
	}
}
int main()
{
	list l;
	l.dau=l.cuoi=NULL;
	menu(l);
	return 0;
}