KumanovskIDijalekt

package kumanovski_dijalekt;

import java.util.ArrayList;
import java.util.Scanner;

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.
			return Math.abs(key.hashCode()) % 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 Kumanovski_Dijalekt {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		Integer n = Integer.parseInt(sc.nextLine());
		CBHT<String,String> hesh =new CBHT<>(2*n);

		for(int i=0;i<n;i++){
			String vnesi = sc.nextLine();
			String[] parts= vnesi.split(" ");
			hesh.insert(parts[0], parts[1]);
		}

		String tekst = sc.nextLine();
		int flag=0;
		int flag1=0;
		String[] recenica = tekst.split(" ");
		ArrayList<String> recenicaPrevedena= new ArrayList<>();
		for(int i=0;i<recenica.length;i++){
			String zbor = recenica[i];

			String prvaBukva=zbor.substring(0,1);

			char[] c =prvaBukva.toCharArray();

			if(Character.isUpperCase(c[0])){
				flag1=1;
			}

			zbor=zbor.toLowerCase();

			String posledenZnak=new String();
			if(zbor.endsWith(",") || zbor.endsWith(",")
					|| zbor.endsWith("!") || zbor.endsWith("?")){
				posledenZnak=zbor.substring(zbor.length()-1,zbor.length());
				zbor = zbor.substring(0,zbor.length()-1);
				flag=1;
			}

			SLLNode<MapEntry<String,String>> node = hesh.search(zbor);


			if(node!=null){
				if(node.element.value.equals(zbor)){
					if(flag==1){

						if(flag1==1){
							String novZbor= node.element.value.substring(1, node.element.value.length());
							recenicaPrevedena.add(prvaBukva+ novZbor +posledenZnak+" ");
							flag1=0;
						}else
							recenicaPrevedena.add(node.element.value +posledenZnak+" ");
						flag=0;
					}else
					recenicaPrevedena.add(node.element.value +" ");
				}else{
					if(flag==1){

						if(flag1==1){
							String novZbor= node.element.value.substring(1, node.element.value.length());

							recenicaPrevedena.add(prvaBukva+ novZbor +posledenZnak+" ");
							flag1=0;
						}else
							recenicaPrevedena.add(node.element.value +posledenZnak+" ");
						flag=0;
					}else{
						if(flag1==1){
							String novZbor= node.element.value.substring(1, node.element.value.length());
							prvaBukva= node.element.value.substring(0,1).toUpperCase();
							recenicaPrevedena.add(prvaBukva+ novZbor +posledenZnak+" ");
							flag1=0;
						}else
							recenicaPrevedena.add(node.element.value+ " ");
					}
				}

			}else{
				if(flag==1){
					if(flag1==1){
						String novZbor= zbor.substring(1, zbor.length());

						recenicaPrevedena.add(prvaBukva+ novZbor +posledenZnak+" ");
						flag1=0;
					}else
						recenicaPrevedena.add(zbor + posledenZnak+" ");
					flag=0;
				}else{
					if(flag1==1){
						String novZbor= zbor.substring(1, zbor.length());

						recenicaPrevedena.add(prvaBukva+ novZbor +posledenZnak+" ");
						flag1=0;
					}else
						recenicaPrevedena.add(zbor + " ");
				}
			}
		}

		for (String l : recenicaPrevedena){
			System.out.print(l);
		}
	}

}