---{"category_name":"easy","problem_code":"DIFSTR","problem_name":"Different String","problemComponents":{"constraints":"- $1 \\leq T \\leq 100$\n- $1 \\leq N \\leq 100$","constraintsState":true,"subtasks":"","subtasksState":false,"inputFormat":"- The first line will contain $T$ - the number of test cases. Then the test cases follow.\n\n- The first line of each test case contains $N$ - the number of strings and length of strings.\n\n- Each of the next $N$ lines contains a binary string of length $N$.","inputFormatState":true,"outputFormat":"For each test case, print on one line a binary string of length $N$, which is different from all of the given strings. If there are multiple possible answers, print any.","outputFormatState":true,"sampleTestCases":{"0":{"id":1,"input":"2\n3\n101\n110\n100\n4\n1100\n1010\n0100\n0010","output":"111\n1101","explanation":"**Test case $1$:** $111$ is different from $101$ , $110$ , $100$.\n\n**Test case $2$:** $1101$ is different from $1100$ , $1010$ , $0100$ , $0010$.","isDeleted":false}}},"video_editorial_url":"https://youtu.be/NHzThs0Bu5A","languages_supported":{"0":"CPP14","1":"C","2":"JAVA","3":"PYTH 3.6","4":"CPP17","5":"PYTH","6":"PYP3","7":"CS2","8":"ADA","9":"PYPY","10":"TEXT","11":"PAS fpc","12":"NODEJS","13":"RUBY","14":"PHP","15":"GO","16":"HASK","17":"TCL","18":"PERL","19":"SCALA","20":"LUA","21":"kotlin","22":"BASH","23":"JS","24":"LISP sbcl","25":"rust","26":"PAS gpc","27":"BF","28":"CLOJ","29":"R","30":"D","31":"CAML","32":"FORT","33":"ASM","34":"swift","35":"FS","36":"WSPC","37":"LISP clisp","38":"SQL","39":"SCM guile","40":"PERL6","41":"ERL","42":"CLPS","43":"ICK","44":"NICE","45":"PRLG","46":"ICON","47":"COB","48":"SCM chicken","49":"PIKE","50":"SCM qobi","51":"ST","52":"SQLQ","53":"NEM"},"max_timelimit":1,"source_sizelimit":50000,"problem_author":"aomine23","problem_tester":"","date_added":"30-06-2021","tags":{"0":"ad","1":"aomine23","2":"cook132","3":"easy","4":"pigeonhole","5":"randomized"},"problem_difficulty_level":"Unavailable","best_tag":"Ad Hoc","editorial_url":"https://discuss.codechef.com/problems/DIFSTR","time":{"view_start_date":1629658802,"submit_start_date":1629658802,"visible_start_date":1629658802,"end_date":1735669800},"is_direct_submittable":false,"problemDiscussURL":"https://discuss.codechef.com/search?q=DIFSTR","is_proctored":false,"visitedContests":{},"layout":"problem"}---### Read problems statements in [Mandarin Chinese](https://www.codechef.com/download/translated/COOK132/mandarin/DIFSTR.pdf), [Russian](https://www.codechef.com/download/translated/COOK132/russian/DIFSTR.pdf), and [Bengali](https://www.codechef.com/download/translated/COOK132/bengali/DIFSTR.pdf) as well.You are given $N$ binary strings of length $N$ each. You need to find a binary string of length $N$ which is different from all of the given strings.Note:- A binary string is defined as a string consisting only of `'0'` and `'1'`.- A string is considered different from another string when they have different lengths, or when they differ in at least one position.<aside style='background: #f8f8f8;padding: 10px 15px;'><div>All submissions for this problem are available.</div></aside>