rome

# Определить структуру соответствия римской цифры и арабской
# Считываем число (< 4000)
# Разбиваем число на слагаемые, сохранем в список
# Каждое слагаемое прогоняем по списку
# Собираем ответ


# 1000 -> M
# 10 -> "IX"

# "X" -> 10, "IX" -> 10 - 1
# "IV" -> 5 - 1

# "I", "V", "X", "L", "C", "D", "M"
#  1,   5,   10,  50, 100, 500, 1000

# "XLIV" <- 44
# "LV" <- 55

# [{1: "I"}, {5: "V"} ... ]
# [["I", 1], ["V", 5] ... ]

# 50, 5

# L, V

# 65 -> LXV -> 50, 10, 5
# 85 -> LXXXV -> 50, 10, 10, 10, 5
# 95 -> XCV -> 100, 10, 5

# IC -> wrong 99 -> XCIX

# IX, IV
# XC, XL
# CM, CD


# people_1 = {
#     "alex": 23, "jack": 45
# }

# people_1.update({"alex": 25})

# print(people_1.keys())

# print(people_1.values())

# people_2 = [["alex", 23], ["jack", 45]]

# for people in people_2:
#     if people[0] == "alex":
#         print("YES")
#         break

# if "alex" in people_1:
#     print("YES")

# people_1["alex"] # b4g5h673jdfkjd -> 75: alex -> 23

# # 1 sec. N -> N sec

# # N/2 sec. N * N/2 -> N^2/2