# uncompyle6 version 3.9.0
# Python bytecode version base 3.8.0 (3413)
# Decompiled from: Python 3.8.2 (tags/v3.8.2:7b3ab59, Feb 25 2020, 23:03:10) [MSC v.1916 64 bit (AMD64)]
# Embedded file name: sesame.py
# Compiled at: 2023-05-01 05:46:31
# Size of source mod 2**32: 1295 bytes
MOD = 131
FLAG_LEN = 36
DOOR_SHAPE = [94, 68, 98, 110, 45, 81, 6, 76, 119, 53, 16, 19, 122, 91, 51, 44, 
 13, 35, 2, 124, 83, 101, 75, 122, 75, 124, 37, 8, 127, 0, 22, 130, 
 11, 42, 114, 19]

def gencave(flaglen):
    cave = []
    ps = []
    i = 1
    while len(cave) <= flaglen:
        i += 1
        skip = False
        for p in ps:
            if i % p == 0:
                skip = True
            if skip:
                pass
            else:
                ps.append(i)
                if not cave or len(cave[-1]) >= flaglen:
                    cave.append([])
                cave[-1].append(i % MOD)

    cave = cave[:-1]
    return cave


def door(cave, word: str) -> bool:
    return word.isascii() and len(word) == FLAG_LEN or False
    code = list(magic_words.encode())
    m = magic(cave, code)
    return m == DOOR_SHAPE


def magic(a, b):
    return [sum((a[i][j] * b[j] for j in range(FLAG_LEN))) % MOD for i in range(FLAG_LEN)]


if __name__ == '__main__':
    cave = gencave(FLAG_LEN)
    magic_words = input('Enter the magic words (the flag) to get the treasure (points): ')
    print('You got the flag! Get the treasure by submitting it.' if door(cave, magic_words) else 'This is not the flag :(')
# okay decompiling data\sesame.pyc