{"trustable":false,"prependHtml":"\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 async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cbr\u003e烤先生希望一些孩子帮助他做一个项目。\n\u003cbr\u003e由于项目相当复杂,人数越多越好。不过为了项目的和谐,烤先生希望做项目的孩子们都是直接或间接的朋友。\n\u003cbr\u003e一开始,来面试的孩子共10000000个,编号从1到10000000。\n\u003cbr\u003e给出所有直接朋友关系,请问烤先生最多可以选择多少个孩子来创业!\n"}},{"title":"Input","value":{"format":"HTML","content":"多组数据读入。每组数据输入的第一行包含整数n(0≤n≤100000)-直接朋友关系的数量。接下来的n行分别包含一对数字A和B,并用一个空格隔开,这表明A和B是直接朋友。(A≠B,1≤A,B≤10000000)"}},{"title":"Output","value":{"format":"HTML","content":"每组数据输出一行,包含一个整数,该整数等于烤先生可以选择的孩子最大数量。"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e4\n1 2\n3 4\n5 6\n1 6\n4\n1 2\n3 4\n5 6\n7 8\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e4\n2"}}]}