[HackerRank][Python] Dictionaries and Maps

Task
Given n names and phone numbers, assemble a phone book that maps friends' names to their respective phone numbers. You will then be given an unknown number of names to query your phone book for. For each  queried, print the associated entry from your phone book on a new line in the form name=phoneNumber; if an entry for name is not found, print Not found instead.

Note: Your phone book should be a Dictionary/Map/HashMap data structure.

Input Format

The first line contains an integer, n, denoting the number of entries in the phone book.
Each of the n subsequent lines describes an entry in the form of 2 space-separated values on a single line. The first value is a friend's name, and the second value is an 8-digit phone number.

After the n lines of phone book entries, there are an unknown number of lines of queries. Each line (query) contains a name to look up, and you must continue reading lines until there is no more input.

Note: Names consist of lowercase English alphabetic letters and are first names only.

Constraints

• 1 <= n <= 10^5
• 1 <= queries <= 10^5

Output Format

On a new line for each query, print Not found if the name has no corresponding entry in the phone book; otherwise, print the full name and phoneNumber in the format name=phoneNumber.

# Enter your code here. Read input from STDIN. Print output to STDOUT
n = int(input())
phone_book = {}

# Populate phone book
for i in range(n):
    name, number = input().split()
    phone_book[name] = number

# Query phone book
while True:
    try:
        name = input().strip()
        if name in phone_book:
            print(name + "=" + phone_book[name])
        else:
            print("Not found")
    except:
        break

The code reads the number of entries in the phone book from the first input, then populates a dictionary with the entries. The subsequent inputs are names to query, which are checked against the phone book dictionary. If a matching entry is found, it is printed in the required format, otherwise "Not found" is printed. The program continues reading inputs until there is no more input left to process.