apteka

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class SLLNode<E> {
	protected E element;
	protected SLLNode<E> succ;

	public SLLNode(E elem, SLLNode<E> succ) {
		this.element = elem;
		this.succ = succ;
	}

	@Override
	public String toString() {
		return element.toString();
	}
}
class MapEntry<K extends Comparable<K>,E> implements Comparable<K> {

    // Each MapEntry object is a pair consisting of a key (a Comparable
    // object) and a value (an arbitrary object).
    K key;
    E value;

    public MapEntry (K key, E val) {
        this.key = key;
        this.value = val;
    }

    public int compareTo (K that) {
    // Compare this map entry to that map entry.
        @SuppressWarnings("unchecked")
		MapEntry<K,E> other = (MapEntry<K,E>) that;
        return this.key.compareTo(other.key);
    }

    public String toString () {
        return "<" + key + "," + value + ">";
    }
}
class CBHT<K extends Comparable<K>, E> {

	// An object of class CBHT is a closed-bucket hash table, containing
	// entries of class MapEntry.
	private SLLNode<MapEntry<K,E>>[] buckets;

	@SuppressWarnings("unchecked")
	public CBHT(int m) {
		// Construct an empty CBHT with m buckets.
		buckets = (SLLNode<MapEntry<K,E>>[]) new SLLNode[m];
	}

	private int hash(K key) {
		// Translate key to an index of the array buckets.

        String k = (String) key;
		return ((29*(29*(29*0+k.charAt(0))+k.charAt(1))+k.charAt(2))%102780)%buckets.length;
	}

	public SLLNode<MapEntry<K,E>> search(K targetKey) {
		// Find which if any node of this CBHT contains an entry whose key is
		// equal
		// to targetKey. Return a link to that node (or null if there is none).
		int b = hash(targetKey);
		for (SLLNode<MapEntry<K,E>> curr = buckets[b]; curr != null; curr = curr.succ) {
			if (targetKey.equals(((MapEntry<K, E>) curr.element).key))
				return curr;
		}
		return null;
	}

	public void insert(K key, E val) {		// Insert the entry <key, val> into this CBHT.
		MapEntry<K, E> newEntry = new MapEntry<K, E>(key, val);
		int b = hash(key);
		for (SLLNode<MapEntry<K,E>> curr = buckets[b]; curr != null; curr = curr.succ) {
			if (key.equals(((MapEntry<K, E>) curr.element).key)) {
				// Make newEntry replace the existing entry ...
				curr.element = newEntry;
				return;
			}
		}
		// Insert newEntry at the front of the 1WLL in bucket b ...
		buckets[b] = new SLLNode<MapEntry<K,E>>(newEntry, buckets[b]);
	}

	public void delete(K key) {
		// Delete the entry (if any) whose key is equal to key from this CBHT.
		int b = hash(key);
		for (SLLNode<MapEntry<K,E>> pred = null, curr = buckets[b]; curr != null; pred = curr, curr = curr.succ) {
			if (key.equals(((MapEntry<K,E>) curr.element).key)) {
				if (pred == null)
					buckets[b] = curr.succ;
				else
					pred.succ = curr.succ;
				return;
			}
		}
	}

	public String toString() {
		String temp = "";
		for (int i = 0; i < buckets.length; i++) {
			temp += i + ":";
			for (SLLNode<MapEntry<K,E>> curr = buckets[i]; curr != null; curr = curr.succ) {
				temp += curr.element.toString() + " ";
			}
			temp += "\n";
		}
		return temp;
	}

}
public class Apteka {

    public static void main(String[] args)throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int N = Integer.parseInt(br.readLine());

        CBHT<String, Lek> table = new CBHT(N*2);

        for (int i = 0; i < N; i++) {

            String line = br.readLine();

            String[] pom = line.split(" ");

            Lek drug =new Lek(pom[0],Byte.parseByte(pom[1]),Integer.parseInt(pom[2]),Integer.parseInt(pom[3]));

            table.insert(pom[0],drug);
        }
        while(true)
        {
             String name = br.readLine();
             if(name.equals("KRAJ"))
             {
                 break;
             }
             int numb  =Integer.parseInt(br.readLine());

             name = name.toUpperCase();

             SLLNode<MapEntry<String,Lek>> f = table.search(name);

             if(f!=null)
             {
                 if(numb<=f.element.value.zaliha)
                 {
                     System.out.println(f.element.value);
                     System.out.println("Napravena naracka");

                     Lek temp = new Lek(f.element.value.ime,f.element.value.lista,f.element.value.cena,f.element.value.zaliha);
                     temp.zaliha = temp.zaliha-numb;
                     table.insert(temp.ime, temp);
                 }
                 else
                 {
                     System.out.println("Nema dovolno lekovi");
                 }
             }
             else
             {
                 System.out.println("Nema takov lek");
             }
        }


    }

}

class Lek
{
    String ime;
    byte lista;
    int cena;
    int zaliha;

    public Lek(String ime, byte lista, int cena, int zaliha) {
        this.ime = ime;
        this.lista = lista;
        this.cena = cena;
        this.zaliha = zaliha;
    }

    public String toString()
    {
        String s = "";
        if(lista==1)
            s+="POZ";
        else
            s+="NEG";

        return ime+"\n"+s+"\n"+cena+"\n"+zaliha;
    }
}