your friend hide direct graph n nodeslet fuv true direct path node u node v false for pair distinct node uv know statement true here and or XOR mean and or exclusive or operation respectivelyYou give n n matrix say statement hold pair vertex the entry uth row vth column single character if statement hold represented character a if second hold represent character o if hold represent character x the diagonal matrix contain character note possible pair node satisfy multiple statement case character give represent true statement pair this matrix guarantee symmetricyou like know direct graph consistent matrix if impossible print integer 1 otherwise print minimum number edge consistent information