[АПС] Родендени

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

public class Rodendeni {

    public static boolean isPrime(int m){
        for(int i = 2; i < Math.sqrt(m); i++)
            if(m % i == 0)
                return false;

        return true;
    }

    public static int findM(int n){
        int m = (int)(n/0.6);

        while (!isPrime(m))
            m++;
        return m;
    }

    public static void main(String[] args) throws IOException {
    // write your code here
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(bufferedReader.readLine());
        CBHT<Integer, String> lista = new CBHT<>(findM(n));
        String [] human = new String[2];
        String [] date = new String[3];

        for(int i = 0; i < n; i++){
            human = bufferedReader.readLine().split("\\s+");
            date = human[1].split("\\.");
            int mesec = Integer.parseInt(date[1]);

            SLLNode<MapEntry<Integer, String>> h = lista.search(mesec);
            if(h == null)
                lista.insert(mesec, human[0]);
            else {
                String names = h.element.value;
                if(!names.contains(human[0]))
                names += " " + human[0];
                lista.insert(mesec, names);
            }
        }

        int s = Integer.parseInt(bufferedReader.readLine());
        SLLNode<MapEntry<Integer, String>> h = lista.search(s);
        if(h == null)
            System.out.println("Nema");
        else System.out.println(h.element.value);

    }
}


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> {
    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;
            }
        }
    }
}

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

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