#int-input def II(): return int(input()) class fenwick_tree(): n=1 data=[0 for i in range(n)] def __init__(self,N): self.n=N self.data=[0 for i in range(N)] def add(self,p,x): assert 0<=p0): s+=self.data[r-1] r-=r&-r return s n = II() if n <= 1983: print("None") elif n <= 2007: print("Namiki High School") else: print("Namiki Secondary School")