The city of Hakodate recently established a commodity exchange market. To participate in the market, each dealer transmits through the Internet an order consisting of his or her name, the type of the order (buy or sell), the name of the commodity, and the quoted price.

In this market a deal can be made only if the price of a sell order is lower than or equal to the price of a buy order. The price of the deal is the mean of the prices of the buy and sell orders, where the mean price is rounded downward to the nearest integer. To exclude dishonest deals, no deal is made between a pair of sell and buy orders from the same dealer. The system of the market maintains the list of orders for which a deal has not been made and processes a new order in the following manner.

* For a new sell order, a deal is made with the buy order with the highest price in the list satisfying the conditions. If there is more than one buy order with the same price, the deal is made with the earliest of them.
* For a new buy order, a deal is made with the sell order with the lowest price in the list satisfying the conditions. If there is more than one sell order with the same price, the deal is made with the earliest of them.



The market opens at 7:00 and closes at 22:00 everyday. When the market closes, all the remaining orders are cancelled. To keep complete record of the market, the system of the market saves all the orders it received everyday.

The manager of the market asked the system administrator to make a program which reports the activity of the market. The report must contain two kinds of information. For each commodity the report must contain informationon the lowest, the average and the highest prices of successful deals. For each dealer, the report must contain information on the amounts the dealer paid and received for commodities.



Input

The input contains several data sets. Each data set represents the record of the market on one day. The first line of each data set contains an integer n (n < 1000) which is the number of orders in the record. Each line of the record describes an order, consisting of the name of the dealer, the type of the order, the name of the commodity, and the quoted price. They are separated by a single space character.

The name of a dealer consists of capital alphabetical letters and is less than 10 characters in length. The type of an order is indicated by a string, "BUY" or "SELL". The name of a commodity is a single capital letter. The quoted price is a positive integer less than 1000.

The orders in a record are arranged according to time when they were received and the first line of the record corresponds to the oldest order.

The end of the input is indicated by a line containing a zero.

Output

The output for each data set consists of two parts separated by a line containing two hyphen (`-') characters.

The first part is output for commodities. For each commodity, your program should output the name of the commodity and the lowest, the average and the highest prices of successful deals in one line. The name and the prices in a line should be separated by a space character. The average price is rounded downward to the nearest integer. The output should contain only the commodities for which deals are made and the order of the output must be alphabetic.

The second part is output for dealers. For each dealer, your program should output the name of the dealer, the amounts the dealer paid and received for commodities. The name and the numbers in a line should be separated by a space character. The output should contain all the dealers who transmitted orders. The order of dealers in the output must be lexicographic on their names. The lexicographic order is the order in which words in dictionaries are arranged.

The output for each data set should be followed by a linecontaining ten hyphen (`-') characters.

Example

Input

3
PERLIS SELL A 300
WILKES BUY A 200
HAMMING SELL A 100
4
BACKUS SELL A 10
FLOYD BUY A 20
IVERSON SELL B 30
BACKUS BUY B 40
7
WILKINSON SELL A 500
MCCARTHY BUY C 300
WILKINSON SELL C 200
DIJKSTRA SELL B 100
BACHMAN BUY A 400
DIJKSTRA BUY A 600
WILKINSON SELL A 300
2
ABCD SELL X 10
ABC BUY X 15
2
A SELL M 100
A BUY M 100
0


Output

A 150 150 150
--
HAMMING 0 150
PERLIS 0 0
WILKES 150 0
----------
A 15 15 15
B 35 35 35
--
BACKUS 35 15
FLOYD 15 0
IVERSON 0 35
----------
A 350 450 550
C 250 250 250
--
BACHMAN 350 0
DIJKSTRA 550 0
MCCARTHY 250 0
WILKINSON 0 1150
----------
X 12 12 12
--
ABC 12 0
ABCD 0 12
----------
--
A 0 0
----------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for(int i = a; i < (int)b; i++)
#define pb push_back
#define mp make_pair
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
const int INF = 1<<28;
const ll MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

struct order {
	string name;
	char com;
	int price;
	bool operator < (const order &a) const {
		return price < a.price;
	}
};

struct comodity {
	int min, max, sum, cnt;
};

void addCom(map<char, comodity> &m, int v, char name) {
	if(!m.count(name)) {
		comodity c;
		c.min = c.max = c.sum = v;
		c.cnt = 1;
		m[name] = c;
	}
	else {
		m[name].min = min(m[name].min, v);
		m[name].max = max(m[name].max, v);
		m[name].sum += v;
		m[name].cnt++;
	}
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n;
	while(cin >> n, n) {
		vector<order> buy, sell;
		map<string, pi> ppl;
		map<char, comodity> m;
		REP(i, n) {
			order o; string in;
			cin >> o.name >> in >> o.com >> o.price;
			if(!ppl.count(o.name))
				ppl[o.name] = mp(0,0);
/*
			cout << "-----" << i << endl;
			cout << o.name << ' ' << in << ' ' << o.com << ' ' << o.price << endl;
			cout << "-----BUY" << endl;
			REP(i, buy.size())
				cout << buy[i].name << ' ' << buy[i].com << ' ' << buy[i].price << endl;
			cout << "-----SELL" << endl;
			REP(i, sell.size())
				cout << sell[i].name << ' ' << sell[i].com << ' ' << sell[i].price << endl;
*/
			bool flg = false;
			int v, pnt;
			if(in == "SELL") {
				REP(j, buy.size()) {
					if(o.com == buy[j].com && o.name != buy[j].name && o.price <= buy[j].price) {
						v = (o.price + buy[j].price) / 2;
						addCom(m, v, o.com);
						flg = true;
						pnt = j;
						break;
					}
				}
				if(flg) {
					ppl[buy[pnt].name].first += v;
					ppl[o.name].second += v;
					buy.erase(buy.begin() + pnt);
				}
				else {
					sell.pb(o);
					stable_sort(sell.begin(), sell.end());
				}
			}
			else if(in == "BUY") {
				REP(j, sell.size()) {
					if(o.com == sell[j].com && o.name != sell[j].name && o.price >= sell[j].price) {
						v = (o.price + sell[j].price) / 2;
						addCom(m, v, o.com);
						flg = true;
						pnt = j;
						break;
					}
				}
				if(flg) {
					ppl[o.name].first += v;
					ppl[sell[pnt].name].second += v;
					sell.erase(sell.begin() + pnt);
				}
				else {
					buy.pb(o);
					stable_sort(buy.rbegin(), buy.rend());
				}
			}
		}
		for(auto i : m)
			cout << i.first << ' ' << i.second.min << ' ' << i.second.sum / i.second.cnt << ' ' << i.second.max << endl;
		cout << "--" << endl;
		for(auto i : ppl)
			cout << i.first << ' ' << i.second.first << ' ' << i.second.second << endl;
		cout << "----------" << endl;
	}
	return 0;
}