class SquareMatrix(): def __init__(self, n, mod=1000000007): self.n = n self.mat = [[0 for j in range(n)] for i in range(n)] self.mod = mod @staticmethod def id(n): res = SquareMatrix(n) for i in range(n): res.mat[i][i] = 1 return res def operate(self, vec): assert len(vec) == self.n res = [0 for _ in range(self.n)] for i in range(self.n): for j in range(self.n): res[i] += self.mat[i][j] * vec[j] res[i] %= self.mod return res def add(self, other): assert other.n == self.n res = SquareMatrix(self.n) for i in range(self.n): for j in range(self.n): res.mat[i][j] = self.mat[i][j] + other.mat[i][j] res.mat[i][j] %= self.mod return res def subtract(self, other): assert other.n == self.n res = SquareMatrix(self.n) for i in range(self.n): for j in range(self.n): res.mat[i][j] = self.mat[i][j] - other.mat[i][j] res.mat[i][j] %= self.mod return res def times(self, k): res = SquareMatrix(self.n) for i in range(self.n): for j in range(self.n): res.mat[i][j] = self.mat[i][j] * k res.mat[i][j] %= self.mod return res def multiply(self, other): #O(n^3) assert self.n == other.n res = SquareMatrix(self.n) for i in range(self.n): for j in range(self.n): for k in range(self.n): res.mat[i][j] += self.mat[i][k] * other.mat[k][j] res.mat[i][j] %= self.mod return res def power(self, k): tmp = SquareMatrix(self.n) for i in range(self.n): for j in range(self.n): tmp.mat[i][j] = self.mat[i][j] res = SquareMatrix.id(self.n) while k: if k & 1: res = res.multiply(tmp) tmp = tmp.multiply(tmp) k >>= 1 return res N = int(input()) A = list(map(int, input().split())) M = SquareMatrix(3) for i in range(3): M.mat[i][i] = 1 M.mat[i][i - 1] = 0 M.mat[i][i - 2] = -1 res = M.power(N - 1).operate(A) print(*res)