data = [
    0x0, 0x67, 0x6e, 0x62, 0x63, 0x7e, 0x74, 0x62, 0x69, 0x6d,
    0x55, 0x6a, 0x7f, 0x60, 0x51, 0x66, 0x63, 0x4e, 0x66, 0x7b,
    0x71, 0x4a, 0x74, 0x76, 0x6b, 0x70, 0x79, 0x66, 0x1c
]
new = []
for i, b in enumerate(data):
    new.append(chr((i^b)&(0xFF)))
print(''.join(new[1:]))

# Python27
# uncompyle6 version 3.6.4
# Python bytecode 2.7 (62211)
# Decompiled from: Python 2.7.17 (default, Nov  7 2019, 10:07:09) 
# [GCC 7.4.0]
# Embedded file name: 1.py
# Compiled at: 2017-06-03 10:20:43
import base64

def encode(message):
    s = ''
    for i in message:
        x = ord(i) ^ 32
        x = x + 16
        s += chr(x)

    return base64.b64encode(s)

correct = 'XlNkVmtUI1MgXWBZXCFeKY+AaXNt'
flag = ''
print 'Input flag:'
flag = raw_input()
if encode(flag) == correct:
    print 'correct'
else:
    print 'wrong'
# okay decompiling Py.pyc

# Python37
''.join([chr(((c-16)^32)&0xFF) for c in base64.b64decode('XlNkVmtUI1MgXWBZXCFeKY+AaXNt')])

# encoding=utf8
# python37
R = "  *******   *  **** * ****  * ***  *#  *** *** ***     *********"

def func(s):
    b, v24, v28, r = 5, 0, 0, 0
    while b < len(s):
        if s[b] == chr(0x4f):   # O
            r = v24 == 0
            v24 -= 1
        elif s[b] == chr(0x6f): # o
            v24 += 1
            r = v24 < 8
        elif s[b] == chr(0x2e): # .
            r = v28 == 0
            v28 -= 1
        elif s[b] == chr(0x30): # 0
            v28 += 1
            r = v28 < 8
        
        c = R[v24 + v28 * 8]
        if c != chr(0x20) and c != chr(0x23):
            break
        b += 1

    if r and R[v24+v28*8] == chr(0x23):
        print("Congratulation!")
    else:
        print("Wrong flag!")

# encoding=utf8
# python37
R = "  *******   *  **** * ****  * ***  *#  *** *** ***     *********"
direction = [[-1, 0, 'O'], [1, 0, 'o'], [0, -1, '.'], [0, 1, '0']]

seen = set()
stack = []
found = []

def dfs(x, y):
    if 0 <= x+y*8 < len(R):
        if R[x+y*8] == '#':
            print(''.join(stack), len(stack))  # 输出答案
            found.append(True)
        if R[x+y*8] == '*' or found or (x, y) in seen:
            return

        seen.add((x, y))
        for a, b, c in direction:
            stack.append(c)
            dfs(x+a, y+b)
            stack.pop()
dfs(0, 0, '')

def bar(array):
    for i in range(1, 481):
        a = '{:03}'.format(i) * 3
        for j in range(len(array)):
            array[j] = j^array[j]^ord(a[j % len(a)])

import re

a = list(int(f'0x{b}', base=16) for b in re.findall(r'..', '62646163734e346a6f60715f673c6e5b4561777c337657635b7831717b5f74447577297d'))
bar(a)
print(''.join(map(chr, a)))

# encoding=utf8
# python37
def f70e(s):
    """限制输入s为数字0~9，而且长度小于81"""
    if len(s) > 0x51:
        exit(-1)

    for v14 in range(len(s)):
        if s[v14] <= 0x2f or s[v14] > 0x39 :
            exit(-1)

def f78b(s, v30):
    """对于输入s不为'0'的部分，如果v30同样位置的数据不为0程序就会失败退出；
    否则转换为整数并存到v30同样的位置；"""
    for v14 in range(len(s)):
        if s[v14] != 0x30:
            if s[v14] == 0x00:
                exit(-1)
            if v30[v14] == 0:
                v30[v14] = s[v14] - 0x30
            else:
                exit(-1)

def f833(v38):
    for v28 in range(9):
        s = [0] * 0xa
        for v24 in range(9):
            d = (v28 << 3) + v28 + v24
            s[v38[d]] += 1

        for v24 in range(1, 9+1):
            if s[v24] != 0x1:
                exit(-1)

f8fe = f833

def f9c9(v48):
    v28, v24 = 3, 3
    for v34 in range(9):
        s = b'\x00' * 0xa
        for v30 in range(v28-3, v28):
            for v2c in range(v24-3, v24):
                d = (v30 << 3) + v30 + v2c
                s[v48[d]] += 1
        for v30 in range(1, 9+1):
            if s[v30] != 1:
                exit(-1)
        if v24 == 9:
            v24 = 3
            v28 += 3
        else:
            v24 += 3

def fad4(v8):
    f833(v8)
    f8fe(v8)
    f9c9(v8)

def main():
    s = [int(d) for d in input().strip()]
    c = [int(d, base=16) for d in 'This is a sudoku']
    f70e(s)
    f78b(s, c)
    fad4(c)

def sub_400666(n):
    if n>0x3f:
        return

    Global.s1[Global.dw1064] = Global.bt1100[n]
    Global.dw1064 += 1
    sub_400666(2*n+1)
    sub_400666(2*n+2)

def sub_4006BE(n):
    if n>0x3f:
        return

    sub_4006BE(2*n+1)
    Global.s1[Global.dw1064] = Global.bt1100[n]
    Global.dw1064 += 1
    sub_4006BE(2*n+2)

def func(length):
    indices = []
    def bar(n):
        if n>length:
            return
        indices.append(n)
        bar(2*n+1)
        bar(2*n+2)

    bar(0)
    return indices   

indices = func(0x3f)    
s2 = 'bcec8d7dcda25d91ed3e0b720cbb6cf202b09fedbc3e017774273ef5d5581794'

print('nctf{%s}' % ''.join([c for _, c in sorted(enumerate(s2), key=lambda t: indices[t[0]])]))