def sum_string( arr, a, b ):
    n = len( arr )
    for i in range( n ):
        arr[a][i] |= arr[b][i]
    return arr


def yoles( arr ):

    n = len( arr )
    pre_arr = None
    max_count = 3
    count = 0
    while True:
        for i in range( n ):
            for j in range( n ):
                if( i != j ):
                    arr = sum_string(arr, i,j )
                    if arr == pre_arr:
                        count += 1
                    else:
                        count = 0
                    pre_arr = [ a[:] for a in arr ]
                    if count >= max_count:
                        return arr