This crypto challenge uses a text file with some hidden information. If youopen up the file in a text editor, and adjust your window width, you'lleventually see the repeating pattern line up. This makes it very easy to seewhat part of the pattern is actually changing:
```----------------------xxxx----[9km7D9mTfc:..Zt9mTZ_:K0o09mTN[9km7D9mTfc:..Zt9mTZ_:K0o09mTN[9km7D9mTfc:..Zt9mTZ_:IIcu9mTN[9km7D9mTfc:..Zt9mTZ_:IIcu9mTN[9km7D9mTfc:..Zt9mTZ_:K0o09mTN[9km7D9mTfc:..Zt9mTZ_:K0o09mTN[9km7D9mTfc:..Zt9mTZ_:IIcu9mTN[9km7D9mTfc:..Zt9mTZ_:IIcu9mTN[9km7D9mTfc:..Zt9mTZ_:K0o09mTN[9km7D9mTfc:..Zt9mTZ_:K0o09mTN[9km7D9mTfc:..Zt9mTZ_:IIcu9mTN[9km7D9mTfc:..Zt9mTZ_:K0o09mTN[9km7D9mTfc:..Zt9mTZ_:K0o09mTN[9km7D9mTfc:..Zt9mTZ_:IIcu9mTN[9km7D9mTfc:..Zt9mTZ_:IIcu9mTN```
I wrote a simple python script to parse this into binary data, and it worked onthe first try:
```py# read the file into a stringfile = open("./round-the-bases")content = file.read()file.close()
# split on every 30th character into a listn = 30arr = [ content[i : i + n] for i in range(0, len(content), n) ]
bin = []for line in arr:  sub = line[16:20] # the part that changes  if sub == 'IIcu': # IIcu -> 0x0    bin.append('0')  else: #             K0o0 -> 0x1    bin.append('1')
bin = ''.join(bin) # join all the list indices together into a string
# decode the binary string into ascii charactersfor i in range(0, len(bin), 8):  print(chr(int(bin[i:i+8], 2)), end='')
# newline for good measureprint("\n", end='')```