R=solve1()
P1=set([s for s in R if not bit(s,7)])
K=[s for s in R if bit(s,7)]
print('K1',len(K),'all12',all(bit(s,11) for s in K))
def clr(s,bs):
    for b in bs:
        if bit(s,b):
            s=s-(1<<b)
    return s
bases=set([clr(s,[7,8,9,10,11]) for s in K])
print('bases',len(bases))
print('missingbases',sorted(P1-bases))
print('baseextra',sorted(bases-P1))