13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T74c,

Construct an array of $$$4 \cdot n$$$ integers such that:

each number $$$1, 2, \dots, n$$$ appears in the array exactly $$$4$$$ times;
let $$$p_{x, i}$$$ be the position of the $$$i$$$-th occurrence of number $$$x$$$ in the array; then, for each $$$x$$$ from $$$1$$$ to $$$n$$$, the numbers $$$(p_{x, 2} - p_{x, 1}), (p_{x, 3} - p_{x, 2}), (p_{x, 4} - p_{x, 3})$$$ must be pairwise distinct.

For example, for $$$n = 3$$$, one possible array is $$$[1, 1, 2, 1, 2, 3, 1, 3, 2, 2, 3, 3]$$$, because:

$$$p_{1, 2} - p_{1, 1} = 1, p_{1, 3} - p_{1, 2} = 2, p_{1, 4} - p_{1, 3} = 3$$$ — all numbers are distinct;
$$$p_{2, 2} - p_{2, 1} = 2, p_{2, 3} - p_{2, 2} = 4, p_{2, 4} - p_{2, 3} = 1$$$ — all numbers are distinct;
$$$p_{3, 2} - p_{3, 1} = 2, p_{3, 3} - p_{3, 2} = 3, p_{3, 4} - p_{3, 3} = 1$$$ — all numbers are distinct.

Input

Each test contains multiple test cases. The first line contains the number o

Different Distances

Examples