A charity marathon rewards volunteers with bonus hours toward next year's registration priority. Every volunteer has a unique bib number, a name, and the number of hours they logged at the event. A volunteer earns bonus hours equal to their logged hours only when both of the following hold: their bib number is odd, and the first character of their name is not an uppercase Q (the check is case-sensitive, so a lowercase q does not disqualify a volunteer). Every other volunteer earns 0 bonus hours. Compute the bonus hours for every volunteer and list the results in increasing order of bib number.

Input format

Line 1: an integer n — the number of volunteers. Each of the next n lines contains a bib number, a name, and logged hours, space-separated: bib_i name_i hours_i.

Output format

Print n lines, one per volunteer, sorted by ascending bib number. Each line contains two space-separated integers: the bib number and the bonus hours earned.

Constraints

• 1 <= n <= 1000
• 1 <= bib_i <= 10000, and all bib numbers are distinct
• name_i consists of 1 to 15 uppercase and lowercase English letters (no spaces)
• 1 <= hours_i <= 100000

3
3 Alice 40
4 Bob 30
7 Quinn 50

3 40
4 0
7 0

2
2 Maria 20
5 quinn 15

2 0
5 15