{"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":"HTML","content":"\u003cstyle type\u003d\u0027text/css\u0027\u003e .input, .output {border: 1px solid #888888;} .output {margin-bottom:1em;position:relative;top:-1px;} .output pre,.input pre {background-color:#EFEFEF;line-height:1.25em;margin:0;padding:0.25em;} .title {background-color:#FFFFFF;border-bottom: 1px solid #888888;font-family:arial;font-weight:bold;padding:0.25em;} \u003c/style\u003e \u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027]], displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027]]}\n });\n \u003c/script\u003e\n \u003cscript type\u003d\"text/javascript\" async\n src\u003d\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\"\u003e\n \u003c/script\u003e\n\u003cp\u003e现在杰哥成了鱼人岛的岛主,鱼人岛就像它的名字那样,有n个城市通过n-1个路连接,对于任何两个城市,总存在一条路径。\u003c/p\u003e\n\u003cp\u003e杰哥要做的事情就是分配官员,每个官员都有一个等级从\u0027A\u0027到\u0027Z\u0027最多有26个等级,\u0027A\u0027最高级,\u0027Z\u0027最低级,每个级别有无数的军官\u003c/p\u003e\n\u003cp\u003e但是有规则:如果x和y是两个不同的城市并且他们的军官具有相同的等级,那么在x和y之间的简单路径上必须要有个城市有一个\n\u003c/p\u003e\n\u003cp\u003e更高等级的军官 保证中间的军官能监控两边低级的军官,如果不可能 输出\"Impossible\"\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003e第一行输入一个整数 n(2\u003c\u003dn\u003c\u003d10^5) 代表城市的数量\n\u003c/p\u003e\n\u003cp\u003e以下n-1行,每行输入两个整数a和b(1\u003c\u003da,b\u003c\u003dn,a!\u003db)表示在a和b之间有一条道路连通a与b。保证城市的编号从1-n\u003c/p\u003e\n\u003cp\u003e我们保证输入的图示一棵树(即没有环)\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003e逐个输出1-n个城市的等级,每个城市的等级之间有一个空格\u003c/p\u003e\n\u003cp\u003e如果没有有效方案则输入“Impossible”\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003cdiv class\u003d\"sample-test\"\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e\n \u003cpre\u003e4\u003cbr\u003e1 2\u003cbr\u003e1 3\u003cbr\u003e1 4\u003cbr\u003e\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e\n \u003cpre\u003eA B B B\u003cbr\u003e\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e\n \u003cpre\u003e10\u003cbr\u003e1 2\u003cbr\u003e2 3\u003cbr\u003e3 4\u003cbr\u003e4 5\u003cbr\u003e5 6\u003cbr\u003e6 7\u003cbr\u003e7 8\u003cbr\u003e8 9\u003cbr\u003e9 10\u003cbr\u003e\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e\n \u003cpre\u003eD C B A D C B D C D\u003cbr\u003e\u003c/pre\u003e\n \u003c/div\u003e\n\u003c/div\u003e"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first example, for any two officers of rank \u0027\u003cspan class\u003d\"tex-font-style-tt\"\u003eB\u003c/span\u003e\u0027, an officer with rank \u0027\u003cspan class\u003d\"tex-font-style-tt\"\u003eA\u003c/span\u003e\u0027 will be on the path between them. So it is a valid solution.\u003c/p\u003e"}}]}