Counting Liars

아직 제출이 없습니다시간 제한2초메모리 제한1024 MB

문제

Bessie the cow is hiding somewhere along the number line. Each of Farmer John's NN other cows (1N10001\le N\le 1000) have a piece of information to share: the ii-th cow either says that Bessie is hiding at some location less than or equal to p_ip\_i, or that Bessie is hiding at some location greater than or equal to p_ip\_i (0p_i1090\le p\_i\le 10^9).

Unfortunately, it is possible that no hiding location is consistent with the answers of all of the cows, meaning that not all of the cows are telling the truth. Count the minimum number of cows that must be lying.

입력

The first line contains NN.

The next NN lines each contain either L or G, followed by an integer p_ip\_i. L means that the ii-th cow says that Bessie's hiding location is less than or equal to p_ip\_i, and G means that ii-th cow says that Bessie's hiding location is greater than or equal to p_ip\_i.

출력

The minimum number of cows that must be lying.