Zack has messed up all his shoes. He has N shoes(single shoe, not paired). You have to search for the partner of each shoe. Find the maximum pair you can make out of them.
You will be given description of each shoe, the size of the shoe and if it is Left shoe(L) or Right shoe(R). Two shoes can be paired if they are having same size and , one is L and other is R.
First line contains single integer 'N', number of shoes
Next N lines has description for each shoe, with space separated | size and L/R
Single integer, maximum pairs can be made out of the given shoes
shoe size will be a positive integer less than 100