use std::{collections::HashMap, cmp::Reverse};


fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut l = String::new();
    std::io::stdin().read_line(&mut l).ok();
    let l: Vec<usize> = l.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let mut t = String::new();
    std::io::stdin().read_line(&mut t).ok();
    let t: usize = t.trim().parse().unwrap();
    let queries = (0..t).map(|_| {
        let mut temp = String::new();
        std::io::stdin().read_line(&mut temp).ok();
        let temp: Vec<&str> = temp.trim().split_whitespace().collect();
        (temp[0].to_string(), temp[1].chars().nth(0).unwrap() as usize - 'A' as usize)
    })
    .collect::<Vec<_>>();

    let mut user_to_idx = HashMap::new();
    let mut idx_to_user = vec![];
    let mut answered = vec![0usize; n];
    let mut idx2score = vec![];
    let mut last_submit = vec![];
    for (i, (user, pidx)) in queries.iter().enumerate() {
        let uidx = if user_to_idx.contains_key(user) {
                *user_to_idx.get(&user).unwrap()
            } else {
                let idx = user_to_idx.len();
                user_to_idx.insert(user, idx);
                idx2score.push(vec![0usize; n+1]);
                last_submit.push(0usize);
                idx_to_user.push(user.clone());
                idx
            };
        answered[*pidx] += 1;
        let score = 50. * (l[*pidx] as f64) + 50. * (l[*pidx] as f64) / (0.8 + 0.2 * answered[*pidx] as f64);
        let score = score.floor() as usize;
        idx2score[uidx][*pidx] += score;
        idx2score[uidx][n] += score;
        last_submit[uidx] = i;
    }
    let mut users = (0..user_to_idx.len()).collect::<Vec<usize>>();
    users.sort_by_key(|&i| (Reverse(idx2score[i][n]), last_submit[i]));
    for (order, &i) in users.iter().enumerate() {
        println!("{} {} {}", order+1, idx_to_user[i], idx2score[i].iter().map(|v| v.to_string()).collect::<Vec<_>>().join(" "));
    }
}