#!/usr/bin/python3
nta = {
    0:'A',
    1:'B',
    2:'C',
    3:'D',
    4:'E',
    5:'F',
    6:'G',
    7:'H',
    8:'I',
    9:'J',
    10:'K',
    11:'L',
    12:'M',
    13:'N',
    14:'O',
    15:'P',
    16:'Q',
    17:'R',
    18:'S',
    19:'T',
    20:'U',
    21:'V',
    22:'W',
    23:'X',
    24:'Y',
    25:'Z',
}

atn = {
    'A':0,
    'B':1,
    'C':2,
    'D':3,
    'E':4,
    'F':5,
    'G':6,
    'H':7,
    'I':8,
    'J':9,
    'K':10,
    'L':11,
    'M':12,
    'N':13,
    'O':14,
    'P':15,
    'Q':16,
    'R':17,
    'S':18,
    'T':19,
    'U':20,
    'V':21,
    'W':22,
    'X':23,
    'Y':24,
    'Z':25,
}

def enc(txt,a,b):
    res = ""
    for i in txt:
        res = res + nta[(a*atn[i]+b)%26]
    return res

def dec(txt,a,b):
    res = ""
    for i in txt:
        res = res + nta[(mmi(a)*(atn[i]-b))%26]
    return res

def mmi(n): #too lazy for extended Euclidean algorithm
    for i in range(0,26):
        if (i*n)%26==1:
            return i

def isbij(a,b):
    arr = []
    for i in "ABCDEFGHIJKLMNOPQRSTUVWXYZ":
        v = enc(i,a,b)
        if v in arr:
            return False
        else:
            arr.append(v)
    return True
        
print(enc("ANAKIN",11,5))