CF1093C.Mishka and the Last Exam

Mishka is trying really hard to avoid being kicked out of the university. In particular, he was doing absolutely nothing for the whole semester, miraculously passed some exams so that just one is left.

There were $n$ classes of that subject during the semester and on $i$-th class professor mentioned some non-negative integer $a_i$ to the students. It turned out, the exam was to tell the whole sequence back to the professor.

Sounds easy enough for those who attended every class, doesn't it?

Obviously Mishka didn't attend any classes. However, professor left some clues on the values of $a$ to help out students like Mishka:

• $a$ was sorted in non-decreasing order ($a_1 \le a_2 \le \dots \le a_n$);
• $n$ was even;
• the following sequence $b$, consisting of $\frac n 2$ elements, was formed and given out to students: $b_i = a_i + a_{n - i + 1}$.

Professor also mentioned that any sequence $a$, which produces sequence $b$ with the presented technique, will be acceptable.

Help Mishka to pass that last exam. Restore any sorted sequence $a$ of non-negative integers, which produces sequence $b$ with the presented technique. It is guaranteed that there exists at least one correct sequence $a$, which produces the given sequence $b$.

米什卡正竭尽全力避免被大学开除。特别是，整个学期他完全无所事事，却奇迹般地通过了若干门考试，目前仅剩最后一门尚未通过。

该课程在本学期共开设了 $n$ 节课，第 $i$ 节课上，教授向学生们提到了某个非负整数 $a_i$。结果，期末考试的内容就是将整个序列 $a$ 完整地复述给教授。

对那些每节课都出席的学生来说，这听起来很简单，不是吗？

显然，米什卡一节课都没上。不过，教授留下了一些关于序列 $a$ 的线索，以帮助像米什卡这样的学生：

• 序列 $a$ 是按非递减顺序排列的（即 $a_1 \le a_2 \le \dots \le a_n$）；
• $n$ 是偶数；
• 构造了一个由 $\frac{n}{2}$ 个元素组成的序列 $b$ 并分发给了学生：$b_i = a_i + a_{n - i + 1}$。

教授还特别说明：任何能通过上述方法生成给定序列 $b$ 的序列 $a$ 均可被接受。

请帮助米什卡通过这最后一门考试。恢复出任意一个满足条件的、由非负整数组成的非递减序列 $a$，使其能通过上述方法生成给定的序列 $b$。题目保证至少存在一个正确的序列 $a$ 能生成给定的序列 $b$。

The first line contains a single integer $n$ ($2 \le n \le 2 \cdot 10^5$) — the length of sequence $a$. $n$ is always even.

The second line contains $\frac n 2$ integers $b_1, b_2, \dots, b_{\frac n 2}$ ($0 \le b_i \le 10^{18}$) — sequence $b$, where $b_i = a_i + a_{n - i + 1}$.

It is guaranteed that there exists at least one correct sequence $a$, which produces the given sequence $b$.

第一行包含一个整数 $n$（$2 \le n \le 2 \cdot 10^5$）——序列 $a$ 的长度。$n$ 总是偶数。

第二行包含 $\frac n 2$ 个整数 $b_1, b_2, \dots, b_{\frac n 2}$（$0 \le b_i \le 10^{18}$）——序列 $b$，其中 $b_i = a_i + a_{n - i + 1}$。

保证至少存在一个正确的序列 $a$，能够生成给定的序列 $b$。

Print $n$ integers $a_1, a_2, \dots, a_n$ ($0 \le a_i \le 10^{18}$) in a single line.

$a_1 \le a_2 \le \dots \le a_n$ should be satisfied.

$b_i = a_i + a_{n - i + 1}$ should be satisfied for all valid $i$.

在一行中输出 $n$ 个整数 $a_1, a_2, \dots, a_n$（其中 $0 \le a_i \le 10^{18}$）。

需满足 $a_1 \le a_2 \le \dots \le a_n$。

对所有合法的 $i$，需满足 $b_i = a_i + a_{n - i + 1}$。