from functools import cache
from bisect import bisect_left, bisect_right
import heapq
from itertools import product
from itertools import permutations
import random
import math
import bisect
import sys
from collections import defaultdict
from itertools import combinations
sys.setrecursionlimit(10**7)
inf = 1 << 60


def sgn(x):
    if x > 0:
        return 1
    elif x == 0:
        return 0
    else:
        return -1


def popC(x):
    ans = 0
    while x != 0:
        ans += x % 2
        x //= 2
    return ans


def exit():
    sys.exit()


def LI():
    return list(map(int, input().split()))


def II():
    return int(input())


def SI():
    return input()


mp = {
    "ksun48": "FF00FF",
    "jiangly": "F8AAE5",
    "mulgokizary": "FFC0CB",
    "Radewoosh": "800080",
    "Um_nik": "08E8DE",
    "semiexp": "92D050",
    "heno239": "6BB75B",
    "liuhengxi": "C5DAB1",
    "snuke": "1000AC",
    "hos_lyric": "CAD8F5",
    "Nachia": "7878DB",
    "peti1234": "0A9FEA",
    "potato167": "028FF4"
}
s = input()
if s in mp:
    print(mp[s])
else:
    print("FF6040")