{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"MD","content":"题意概括:多组数据。每组数据中,有两层楼,每层有n\u003c\u003d1000个房间。每层相邻的房间都是联通的。有些房间和楼上对应的房间能联通,用01字符串表示是否能和楼上联通。1表示能。0表示不能。联通都是无向的。请你求出,从任意一层的一个房间开始,不经过走过的房间,最多能到达多少房间。"}},{"title":"Input","value":{"format":"MD","content":"第一行一个T\u003c\u003d100,表示有T组数据\n对于每组数据,有一个n和一个长度为n的01字符串。含义如上描述。"}},{"title":"Output","value":{"format":"MD","content":"输出T行。对于每组数据,输出答案。"}},{"title":"Example","value":{"format":"MD","content":"### Input\n4\n5\n00100\n8\n00000000\n5\n11111\n3\n110\n\n### Output\n6\n8\n10\n6"}}]}