You are given an array $a$ of $n$ integers.

You want to make all elements of $a$ equal to zero by doing the following operation exactly three times:  Select a segment, for each number in this segment we can add a multiple of $len$ to it, where $len$ is the length of this segment (added integers can be different). 

It can be proven that it is always possible to make all elements of $a$ equal to zero.


-----Input-----

The first line contains one integer $n$ ($1 \le n \le 100\,000$): the number of elements of the array.

The second line contains $n$ elements of an array $a$ separated by spaces: $a_1, a_2, \dots, a_n$ ($-10^9 \le a_i \le 10^9$).


-----Output-----

The output should contain six lines representing three operations.

For each operation, print two lines:

  The first line contains two integers $l$, $r$ ($1 \le l \le r \le n$): the bounds of the selected segment.

  The second line contains $r-l+1$ integers $b_l, b_{l+1}, \dots, b_r$ ($-10^{18} \le b_i \le 10^{18}$): the numbers to add to $a_l, a_{l+1}, \ldots, a_r$, respectively; $b_i$ should be divisible by $r - l + 1$. 


-----Example-----
Input
4
1 3 2 4

Output
1 1 
-1
3 4
4 2
2 4
-3 -6 -6

Difficulty: MEDIUM_HARD
Tags: Greedy algorithms

Number theory

Constructive algorithms
Skill types: Greedy algorithms

Starter code:

Solutions:
(N,) = map(int, input().split())
X = list(map(int, input().split()))
if N > 1:
	print(1, N)
	Y = [0] * N
	for i in range(N):
		Y[i] = -(X[i] % (N - 1)) * N
		X[i] = -(X[i] + Y[i])
	print(*Y)
	print(1, 1)
	print(X[0])
	print(2, N)
	print(*X[1:])
else:
	print(1, 1)
	print(-X[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


def main():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print(n, n)
		print(-a[0])
		print(n, n)
		print(a[0])
		print(n, n)
		print(-a[0])
		return
	print(1, n)
	for i in a:
		print(-(i * n), end=' ')
	print()
	print(1, n - 1)
	for i in a:
		i -= i * n
	for i in range(n - 1):
		print(a[i] * (n - 1), end=' ')
	print()
	print(n, n)
	print(a[-1] * (n - 1))
main()


def exgcd(a, b):
	if b == 0:
		return (a, 1, 0)
	(d, y, x) = exgcd(b, a % b)
	y -= a // b * x
	return (d, x, y)
n = int(input())
arr = [int(x) for x in input().split(' ')]
(ge, al, be) = exgcd(n, n - 1)
if n == 1:
	print(1, 1)
	print(-1 * arr[0])
	print('1 1\n0\n1 1\n0')
else:
	print(1, n)
	print(' '.join([str(-1 * i * al * n) for i in arr]))
	print(1, n - 1)
	print(' '.join([str(-1 * i * be * (n - 1)) for i in arr[:-1]]))
	print(2, n)
	print(' '.join(['0' for i in range(n - 2)] + [str(-1 * arr[-1] * be * (n - 1))]))


def modinv(n, p):
	return pow(n, p - 2, p)

def main():
	n = int(input())
	arr = [int(x) for x in input().split()]
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		print(1, 1)
		print(-arr[0])
		return
	if n == 2:
		print(1, 1)
		print(0)
		print(1, 1)
		print(-arr[0])
		print(2, 2)
		print(-arr[1])
		return
	if n == 3:
		print(1, 1)
		print(-arr[0])
		print(2, 2)
		print(-arr[1])
		print(3, 3)
		print(-arr[2])
		return
	X = []
	Y = [0]
	print(1, 1)
	print(-arr[0])
	for i in range(1, n):
		a = arr[i]
		to_add = n - arr[i] % n
		to_sub = arr[i] % n
		if to_sub == 0:
			to_sub = n
		x = arr[i]
		x = to_sub
		X.append((n - 1) * x)
		Y.append(-(arr[i] + (n - 1) * x))
	print(2, n)
	print(*X)
	print(1, n)
	print(*Y)
py2 = round(0.5)
if py2:
	from future_builtins import ascii, filter, hex, map, oct, zip
	range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192

class FastIO(BytesIO):
	newlines = 0

	def __init__(self, file):
		self._file = file
		self._fd = file.fileno()
		self.writable = 'x' in file.mode or 'w' in file.mode
		self.write = super(FastIO, self).write if self.writable else None

	def _fill(self):
		s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
		self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
		return s

	def read(self):
		while self._fill():
			pass
		return super(FastIO, self).read()

	def readline(self):
		while self.newlines == 0:
			s = self._fill()
			self.newlines = s.count(b'\n') + (not s)
		self.newlines -= 1
		return super(FastIO, self).readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.getvalue())
			(self.truncate(0), self.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		if py2:
			self.write = self.buffer.write
			self.read = self.buffer.read
			self.readline = self.buffer.readline
		else:
			self.write = lambda s: self.buffer.write(s.encode('ascii'))
			self.read = lambda : self.buffer.read().decode('ascii')
			self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print('1 1')
	print(-a[0])
	print('1 1')
	print(0)
	print('1 1')
	print(0)
else:
	one = [0] * n
	for i in range(n - 1):
		m = a[i] % (n - 1)
		if m != 0:
			one[i] = n * (n - 1 - m)
		a[i] += one[i]
	print('1', n)
	for i in one:
		print(i, end=' ')
	print()
	print('1', n - 1)
	for i in range(n - 1):
		print(-a[i], end=' ')
	print()
	print(n, n)
	print(-a[n - 1])


import os
import sys, math
from io import BytesIO, IOBase

def main():
	t = 1
	for case in range(t):
		n = int(input())
		l = list(map(int, input().split()))
		print(1, 1)
		print(-1 * l[0])
		if n == 1:
			print(1, 1)
			print(0)
			print(1, 1)
			print(0)
			continue
		print(1, n)
		arr = [0]
		for i in range(1, n):
			v = l[i]
			h = v // n
			k = v % n
			m2 = -1 * k
			arr.append(h - m2)
		for i in arr:
			print(-1 * (i * n), end=' ')
		print()
		print(2, n)
		arr = []
		for i in range(1, n):
			v = l[i]
			h = v // n
			k = v % n
			m2 = -1 * k
			arr.append(m2)
		for i in arr:
			print(-1 * i * (n - 1), end=' ')
		print()
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


from sys import stdin, stdout
input = stdin.readline
n = int(input())
a = list(map(int, input().split()))
ans = []
if n == 1:
	print(1, 1)
	print(1)
	print(1, 1)
	print(1)
	print(1, 1)
	print(-a[0] - 2)
else:
	ans.append([1, n - 1])
	temp = []
	for i in range(n - 1):
		temp.append(a[i] * (n - 1))
		a[i] += a[i] * (n - 1)
	ans.append(temp)
	ans.append([2, n])
	temp = [0] * (n - 2) + [a[-1] * (n - 1)]
	a[-1] += temp[-1]
	ans.append(temp)
	ans.append([1, n])
	temp = []
	for i in range(n):
		temp.append(-a[i])
	ans.append(temp)
	for a in ans:
		print(*a, sep=' ')


N = int(input())
a = list(map(int, input().split()))
if N == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
print(1, 1)
print(-a[0])
a[0] = 0
print(2, N)
ans = []
for i in range(1, N):
	ans.append(a[i] % N * (N - 1))
	a[i] = a[i] + a[i] % N * (N - 1)
print(' '.join(list(map(str, ans))))
for i in range(N):
	a[i] = -a[i]
print(1, N)
print(' '.join(list(map(str, a))))


n = int(input())
arr = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-1 * arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	lis = []
	for i in range(n):
		if arr[i] % n == 0:
			lis.append(arr[i] * -1)
			arr[i] = 0
		else:
			lis.append(arr[i] * n * -1)
			arr[i] += arr[i] * n * -1
	print(1, n)
	print(' '.join((str(x) for x in lis)))
	lis = []
	for i in range(n - 1):
		if arr[i] % (n - 1) == 0:
			lis.append(arr[i] * -1)
			arr[i] = 0
	print(1, n - 1)
	print(' '.join((str(x) for x in lis)))
	lis = []
	for i in range(1, n):
		if arr[i] % (n - 1) == 0:
			lis.append(arr[i] * -1)
			arr[i] = 0
	print(2, n)
	print(' '.join((str(x) for x in lis)))


n = int(input())
arr = list(map(int, input().split()))

def print_array(arr):
	print(' '.join(map(str, arr)))
if n == 1:
	for _ in range(2):
		print(1, 1)
		print(0)
	print(1, 1)
	print(-arr[0])
else:
	print(1, n)
	print_array([-a * n for a in arr])
	print(1, n - 1)
	print_array([a * (n - 1) for a in arr][:-1])
	print(n, n)
	last_el = arr[-1] - arr[-1] * n
	print(-last_el)


from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip

def main():
	n = int(input())
	a = [int(ai) for ai in input().split()]
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		print(1, 1)
		print(-a[0])
		return
	b = [a[i] % n * (n - 1) for i in range(n - 1)]
	print(1, n - 1)
	print(*b)
	print(1, n)
	print(*[-(a[i] + bi) for (i, bi) in enumerate(b)], 0)
	print(n, n)
	print(-a[n - 1])
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


n = int(input())
a = list(map(int, input().split()))
print(f'1 {n}')
for i in a:
	print(-i * n, end=' ')
if n == 1:
	print('')
	for i in range(2):
		print('1 1')
		print('0')
else:
	print(f'\n1 {n - 1}')
	for i in a[:-1]:
		print(i * (n - 1), end=' ')
	print(f'\n2 {n}')
	for i in range(n - 2):
		print('0', end=' ')
	print(a[-1] * (n - 1))


n = int(input())
arr = list(map(int, input().split()))
if n == 1:
	print('1 1')
	print('0')
	print('1 1')
	print('0')
	print('1 1')
	print('{}'.format(-arr[0]))
else:
	print('1 1')
	print('{}'.format(-arr[0]))
	print('1 {}'.format(n))
	print('0', end=' ')
	for i in range(1, n):
		print(-n * arr[i], end=' ')
	print('2 {}'.format(n))
	for i in range(1, n):
		print((n - 1) * arr[i], end=' ')


def calc(nums):
	if len(nums) == 1:
		return [{'r': (1, 1), 'seq': [-nums[0]]}, {'r': (1, 1), 'seq': [0]}, {'r': (1, 1), 'seq': [0]}]
	res = list()
	res.append({'r': (1, 1), 'seq': [-nums[0]]})
	nums[0] = 0
	n = len(nums)
	m = n - 1
	adds = list()
	for i in range(1, n):
		add = nums[i] % n * m
		adds.append(add)
		nums[i] += add
	res.append({'r': (2, n), 'seq': adds})
	res.append({'r': (1, n), 'seq': [-num for num in nums]})
	return res

def get_ints():
	return [int(n) for n in input().split()]

def get_floats():
	return [float(n) for n in input().split()]

def seq2str(seq):
	return ' '.join((str(item) for item in seq))
zzz = get_ints()
assert len(zzz) == 1
n = zzz[0]
zzz = get_ints()
assert len(zzz) == n
nums = zzz
res = calc(nums)
for op in res:
	print(op['r'][0], op['r'][1])
	print(seq2str(op['seq']))


import sys
(_ord, inp, num, neg, _Index) = (lambda x: x, [], 0, False, 0)
(i, s) = (0, sys.stdin.buffer.read())
try:
	while True:
		if s[i] >= b'0'[0]:
			num = 10 * num + _ord(s[i]) - 48
		elif s[i] == b'-'[0]:
			neg = True
		elif s[i] != b'\r'[0]:
			inp.append(-num if neg else num)
			(num, neg) = (0, False)
		i += 1
except IndexError:
	pass
if s and s[-1] >= b'0'[0]:
	inp.append(-num if neg else num)

def fin(size=None):
	global _Index
	if size == None:
		ni = _Index
		_Index += 1
		return inp[ni]
	else:
		ni = _Index
		_Index += size
		return inp[ni:ni + size]
n = fin()
vals = fin(n)
if n >= 2:
	print(1, n)
	ans = [-i * n for i in vals]
	print(*ans)
	print(2, n)
	a1 = [i * (n - 1) for i in vals[1:n]]
	print(*a1)
	print(1, 1)
	print(vals[0] * (n - 1))
else:
	print(1, 1)
	print(-vals[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


n = int(input())
a = [int(s) for s in input().split(' ')]
if n > 3:
	print(1, 1)
	print(-a[0])
	print(2, n)
	lst = []
	for i in range(1, n):
		lst.append(str(a[i] * (n - 1)))
	print(' '.join(lst))
	print(1, n)
	lst2 = ['0'] + [str(-n * int(a) // (n - 1)) for a in lst]
	print(' '.join(lst2))
elif n == 2:
	print(1, 1)
	print(-a[0])
	print(2, 2)
	print(-a[1])
	print(1, 2)
	print(0, 0)
elif n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
elif n == 3:
	print(1, 1)
	print(-a[0])
	print(2, 2)
	print(-a[1])
	print(3, 3)
	print(-a[2])


import sys, io, os
BUFSIZE = 8192

class FastIO(io.IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = io.BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(io.IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
N = int(input())
A = list(map(int, input().split()))
if N == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-A[0])
	exit()
print(1, N)
Ans1 = [0] + [-a * N for a in A[1:]]
print(*Ans1)
print(2, N)
Ans2 = [a * (N - 1) for a in A[1:]]
print(*Ans2)
print(1, 1)
print(-A[0])


import sys
import math
input = sys.stdin.readline
from collections import deque
from queue import LifoQueue
n = int(input())
multi = 0
a = list(map(int, input().split()))
if n > 1:
	for i in range(n - 1):
		multi += a[i]
	print(1, n - 1)
	for i in range(n - 1):
		print(a[i] * (n - 1), end=' ')
	print()
	print(n, n)
	print(n - a[n - 1])
	a[n - 1] = n
	print(1, n)
	for i in range(n - 1):
		print(-a[i] * n, end=' ')
	print(-a[n - 1])
else:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


from sys import stdin
input = stdin.readline
n = int(input())
a = list(map(int, input().rstrip().split()))
print(1, 1)
print(-a[0])
if n > 1:
	print(2, n)
	op1 = []
	for i in range(1, n):
		op1.append(a[i] * (n - 1))
	print(*op1)
	print(1, n)
	print(0, end=' ')
	op2 = []
	for i in range(1, n):
		op2.append(-(a[i] + op1[i - 1]))
	print(*op2)
else:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print('1 1', -a[0], '1 1', '0', '1 1', '0', sep='\n')
	exit(0)
print(1, n)
for i in range(n):
	print(-a[i] * n, end=' ')
	a[i] -= a[i] * n
print()
print(1, n - 1)
for i in range(n - 1):
	print(-a[i], end=' ')
	a[i] = 0
print()
print(n, n)
print(-a[n - 1])
a[n - 1] = 0


import sys
input = lambda : sys.stdin.readline().rstrip()
n = int(input())
a = [int(i) for i in input().split()]
if n == 1:
	print(1, 1)
	print(-a[0])
	for i in range(2):
		print(1, 1)
		print(0)
	exit(0)
print(1, n - 1)
ans = []
for i in range(n - 1):
	ans.append(a[i] * (n - 1))
print(*ans)
for i in range(n - 1):
	a[i] += ans[i]
print(n, n)
print(-a[-1])
a[-1] = 0
print(1, n)
ans = []
for i in a:
	ans.append(-i)
print(*ans)


n = int(input())
an = list(map(int, input().split()))
print('1 1')
print(-an[0])
an[0] = 0
if n == 1:
	print('1 1')
	print(-an[0])
	print('1 1')
	print(-an[0])
else:
	adds = []
	for i in range(1, n):
		new = an[i] % n * (n - 1)
		adds.append(new)
		an[i] += new
		an[i] = -an[i]
	print(2, n)
	print(' '.join(map(str, adds)))
	print(1, n)
	print(' '.join(map(str, an)))


from math import *
from collections import *
from random import *
from decimal import Decimal
from heapq import *
from bisect import *
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 5)

def lis():
	return list(map(int, input().split()))

def ma():
	return map(int, input().split())

def inp():
	return int(input())

def st1():
	return input().rstrip('\n')
t = 1
while t:
	t -= 1
	n = inp()
	a = lis()
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		print(1, 1)
		print(-a[0])
		exit(0)
	if n == 2:
		print(1, 1)
		print(-a[0])
		print(2, 2)
		print(-a[1])
		print(1, 1)
		print(0)
		exit(0)
	if 1:
		print(1, n - 1)
		for i in range(n - 1):
			print(a[i] * (n - 1), end=' ')
		print()
		print(1, n)
		for i in range(n):
			print(-(a[i] * n), end=' ')
			a[i] = a[i] + -a[i] * n
		print()
		print(n, n)
		print(-a[-1])


import sys
n = int(input())
ar = [int(i) for i in input().split()]
if n == 1:
	print(1, 1)
	print(-ar[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	sys.exit(0)
print(1, n - 1)
for i in range(n - 1):
	print(ar[i] * (n - 1), end=' ')
	ar[i] = ar[i] * n
print('')
print(n, n)
print(-ar[n - 1])
ar[n - 1] = 0
print(1, n)
for i in range(n):
	print(-ar[i], end=' ')


N = int(input())
A = list(map(int, input().split()))
B = []
print(1, 1)
print((N - 1) * A[0])
B.append(A[0] + abs(N - A[0]))
if N >= 2:
	print(2, N)
	print(' '.join(map(str, [v * (N - 1) for v in A[1:]])))
	for v in A[1:]:
		B.append(v + v * (N - 1) * (N - 1))
else:
	print(1, 1)
	print(0)
print(1, N)
print(' '.join(map(str, [-v * N for v in A])))


mod = 1000000007
eps = 10 ** (-9)

def main():
	import sys
	input = sys.stdin.readline
	N = int(input())
	A = list(map(int, input().split()))
	if N == 1:
		print(1, 1)
		print(-A[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		exit()
	print(1, N - 1)
	L = []
	for a in A[:-1]:
		L.append((N - 1) * a)
	print(*L)
	print(N, N)
	print((N - 1) * A[-1])
	print(1, N)
	L = []
	for a in A:
		L.append(-N * a)
	print(*L)
main()


import sys
import operator as op
from functools import reduce

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def chinese_remainder(a, p):
	prod = reduce(op.mul, p, 1)
	x = [prod // pi for pi in p]
	return sum((a[i] * pow(x[i], p[i] - 2, p[i]) * x[i] for i in range(len(a)))) % prod

def extended_gcd(a, b):
	(s, old_s) = (0, 1)
	(r, old_r) = (b, a)
	while r:
		q = old_r // r
		(old_r, r) = (r, old_r - q * r)
		(old_s, s) = (s, old_s - q * s)
	return (old_r, old_s, (old_r - old_s * a) // b if b else 0)

def composite_crt(b, m):
	(x, m_prod) = (0, 1)
	for (bi, mi) in zip(b, m):
		(g, s, _) = extended_gcd(m_prod, mi)
		if (bi - x) % mi % g:
			return None
		x += m_prod * (s * ((bi - x) % mi) // g)
		m_prod = m_prod * mi // gcd(m_prod, mi)
	return x % m_prod
inp = [int(x) for x in sys.stdin.read().split()]
ii = 0
n = inp[ii]
ii += 1
p = n - 1
ar = inp[ii:ii + n]
if n == 1:
	x = ar[0]
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-x)
	exit()
toprint1 = ['0']
toprint2 = []
for x in ar[1:]:
	target = composite_crt([x, 0], [n, n - 1])
	toadd = target - x
	toprint1.append(str(toadd))
	toprint2.append(str(-target))
print(1, n)
print(' '.join(toprint1))
print(1, 1)
print(-ar[0])
print(2, n)
print(' '.join(toprint2))


from sys import exit, stdin, stdout
n = int(input())
a = [int(i) for i in stdin.readline().split()]
if n == 1:
	stdout.write('1 1\n' + str(-a[0]) + '\n1 1\n0\n1 1\n0\n')
	exit(0)
stdout.write('2 ' + str(n) + '\n')
stdout.write(' '.join([str(a[i] % n * (n - 1)) for i in range(1, n)]) + '\n')
for i in range(1, n):
	a[i] += a[i] % n * (n - 1)
stdout.write('1 ' + str(n) + '\n')
stdout.write(' '.join(['0'] + [str(-a[i]) for i in range(1, n)]) + '\n')
stdout.write('1 1\n' + str(-a[0]) + '\n')


n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-l[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-l[0])
	l1 = [0]
	l2 = []
	for i in l[1:]:
		l1.append(-n * i)
		l2.append((n - 1) * i)
	print(1, n)
	print(*l1)
	print(2, n)
	print(*l2)


def solve():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	print(1, n - 1)
	for i in range(n - 1):
		if a[i] % n == 0:
			print(0, end=' ')
			continue
		k = a[i]
		a[i] += k * (n - 1)
		print(k * (n - 1), end=' ')
	print()
	print(2, n)
	for i in range(1, n):
		if a[i] % n == 0:
			print(0, end=' ')
			continue
		k = a[i]
		a[i] += k * (n - 1)
		print(k * (n - 1), end=' ')
	print()
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')
	print()
solve()


n = int(input())
a = list(map(int, input().split(' ')))
k = a[0] % n
if k == 0:
	print(1, 1)
	print(-a[0])
	a[0] = 0
else:
	print(1, 1 + k - 1)
	print(-k, end=' ')
	a[0] -= k
	for i in range(k - 1):
		if i == k - 1:
			print(0, end=' ')
		else:
			print(0)
if n == 1:
	print(1, 1)
	print(0)
else:
	print(2, n)
	for i in range(1, n):
		r = a[i] % n
		a[i] += (n - 1) * r
		if i == n - 1:
			print((n - 1) * r, end=' ')
		else:
			print((n - 1) * r)
print(1, n)
for i in range(n):
	print(-a[i], end=' ')


n = int(input())
lis = list(map(int, input().split()))
if n >= 2:
	print(1, 1)
	print(-lis[0])
	print(2, n)
	print(*[lis[i] * (n - 1) for i in range(1, n)])
	print(1, n)
	print(0, *[-(lis[i] * n) for i in range(1, n)])
else:
	print(1, 1)
	print(-lis[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


def tc():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print(1, 1)
		print(-a[0])
		for _ in range(2):
			print(1, 1)
			print(0)
		return
	first = []
	for (i, x) in enumerate(a[:-1]):
		rem = x % n
		if rem <= n // 2:
			delta = rem * (n - 1)
		else:
			delta = -(n - rem) * (n - 1)
		a[i] += delta
		first.append(delta)
	print(1, n - 1)
	print(' '.join(map(str, first)))
	print(n, n)
	print(-a[-1])
	third = []
	for x in a[:-1]:
		third.append(-x)
	third.append(0)
	print(1, n)
	print(' '.join(map(str, third)))
tc()


n = int(input())
a = [int(i) for i in input().split()]
b = [0] * n
c = [0] * n
for i in range(n):
	b[i] = a[i] % n
	c[i] = a[i] // n
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n - 1)
	print(' '.join((str(b[i] * (n - 1)) for i in range(n - 1))))
	print(1, n)
	print(' '.join((str(-(c[i] + b[i]) * n) for i in range(n - 1))), end=' ')
	print(0)
	print(n, n)
	print(-a[n - 1])


import sys, os, io

def rs():
	return sys.stdin.readline().rstrip()

def ri():
	return int(sys.stdin.readline())

def ria():
	return list(map(int, sys.stdin.readline().split()))

def ws(s):
	sys.stdout.write(s + '\n')

def wi(n):
	sys.stdout.write(str(n) + '\n')

def wia(a):
	sys.stdout.write(' '.join([str(x) for x in a]) + '\n')
import math, datetime, functools, itertools, operator, bisect, fractions
from collections import deque, defaultdict, OrderedDict, Counter
from fractions import Fraction
from decimal import Decimal

def main():
	starttime = datetime.datetime.now()
	if os.path.exists('input.txt'):
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	for _ in range(1):
		n = ri()
		a = ria()
		if n > 1:
			print(1, 1)
			print(-a[0])
			print(2, n)
			z = []
			for i in range(1, n):
				z.append(a[i] * (n - 1))
			print(*z)
			print(1, n)
			z = []
			for i in range(1, n):
				z.append(-n * a[i])
			print(0, *z)
		else:
			print(1, 1)
			print(-a[0])
			print(1, 1)
			print(0)
			print(1, 1)
			print(0)
	endtime = datetime.datetime.now()
	time = (endtime - starttime).total_seconds() * 1000
	if os.path.exists('input.txt'):
		print('Time:', time, 'ms')

class FastReader(io.IOBase):
	newlines = 0

	def __init__(self, fd, chunk_size=1024 * 8):
		self._fd = fd
		self._chunk_size = chunk_size
		self.buffer = io.BytesIO()

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self, size=-1):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size if size == -1 else size))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

class FastWriter(io.IOBase):

	def __init__(self, fd):
		self._fd = fd
		self.buffer = io.BytesIO()
		self.write = self.buffer.write

	def flush(self):
		os.write(self._fd, self.buffer.getvalue())
		(self.buffer.truncate(0), self.buffer.seek(0))

class FastStdin(io.IOBase):

	def __init__(self, fd=0):
		self.buffer = FastReader(fd)
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

class FastStdout(io.IOBase):

	def __init__(self, fd=1):
		self.buffer = FastWriter(fd)
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.flush = self.buffer.flush
sys.stdin = FastStdin()
sys.stdout = FastStdout()
main()


from sys import stdin
inp = lambda : stdin.readline().strip()
n = int(inp())
a = [int(x) for x in inp().split()]
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n - 1)
	ans = []
	for i in range(n - 1):
		x = (n - 1) * a[i]
		ans.append(x)
		a[i] += x
	print(*ans)
	print(n, n)
	print(a[-1] * -1 % n)
	a[-1] += a[-1] * -1 % n
	print(1, n)
	ans = []
	for i in range(n):
		ans.append(0 - a[i])
	print(*ans)


import sys
n = int(sys.stdin.readline())
data = [int(d) for d in sys.stdin.readline().strip().split()]
if n > 1:
	print('1 ' + str(n))
	first_iter = []
	for i in range(len(data)):
		first_iter.append(len(data) * (len(data) - 1 - data[i]))
	print(' '.join([str(i) for i in first_iter]))
	for i in range(len(data)):
		data[i] += first_iter[i]
	second_iter = [d * -1 for d in data[1:]]
	print('2 ' + str(n))
	print(' '.join([str(i) for i in second_iter]))
	print('1 1')
	print(str(data[0] * -1))
else:
	print('1 1')
	print(str(data[0] * -1))
	print('1 1')
	print('0')
	print('1 1')
	print('0')


n = int(input())
arr = [int(i) for i in input().split()]
if n > 1:
	print(1, n)
	print(*(-n * a for a in arr))
	print(1, n - 1)
	print(*((n - 1) * a for a in arr[:n - 1]))
	print(n, n)
	print((n - 1) * arr[-1])
else:
	print(1, 1)
	print(-n * arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


import sys, os, io
import math, bisect, operator
(inf, mod) = (float('inf'), 10 ** 9 + 7)
from itertools import groupby, accumulate
from heapq import heapify, heappop, heappush
from collections import deque, Counter, defaultdict
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
Neo = lambda : list(map(int, input().split()))
(test,) = Neo()
n = test
A = Neo()
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-A[0])
else:
	print(1, 1)
	print(-A[0])
	A[0] = 0
	print(2, n)
	for i in range(1, n):
		print(A[i] * (n - 1), end=' ')
		A[i] += A[i] * (n - 1)
	print()
	print(1, n)
	for i in A:
		print(-i, end=' ')


n = int(input())
arr = list(map(int, input().split()))
if n == 1:
	print('1 1')
	print(-1 * arr[0])
	print('1 1')
	print(0)
	print('1 1')
	print(0)
else:
	print('1 1')
	print(-1 * arr[0])
	ans = []
	print('2 ' + str(n))
	for i in range(1, n):
		print((n - 1) * arr[i], end=' ')
		ans.append(n * arr[i])
	print()
	print('1 ' + str(n))
	print(0, end=' ')
	for d in ans:
		print(-1 * d, end=' ')
	print()


import sys

def input():
	return sys.stdin.readline().strip()

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e):
	return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1):
	return int(-(-x // y))

def INT():
	return int(input())

def MAP():
	return map(int, input().split())

def LIST(N=None):
	return list(MAP()) if N is None else [INT() for i in range(N)]

def Yes():
	print('Yes')

def No():
	print('No')

def YES():
	print('YES')

def NO():
	print('NO')
INF = 10 ** 19
MOD = 10 ** 9 + 7
N = INT()
A = LIST()
if N == 1:
	print(1, 1)
	print(-A[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
ans1 = [0] * N
print(1, N)
for i in range(N):
	need = -A[i] % (N - 1)
	ans1[i] = N * need
print(*ans1)
ans2 = [0] * (N - 1)
print(1, N - 1)
for i in range(N - 1):
	ans2[i] = -(A[i] + ans1[i])
print(*ans2)
print(N, N)
print(-(A[-1] + ans1[-1]))


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-a[0])
	print(1, n)
	ops = [str(-a[i] * n) for i in range(1, n)]
	print(0, ' '.join(ops))
	print(2, n)
	ops = [str(a[i] * (n - 1)) for i in range(1, n)]
	print(' '.join(ops))


from sys import stdin

def inp():
	return stdin.buffer.readline().rstrip().decode('utf8')

def itg():
	return int(stdin.buffer.readline())

def mpint():
	return map(int, stdin.buffer.readline().split())
n = itg()
if n == 1:
	print('1 1')
	print(-itg())
	print('1 1')
	print('0')
	print('1 1')
	print('0')
	exit()
arr = list(mpint())
print(1, n - 1)
print(*map(lambda x: x * (n - 1), arr[:-1]))
print(2, n)
print(*[0] * (n - 2) + [arr[-1] * (n - 1)])
print(1, n)
print(*map(lambda x: -x * n, arr))


import sys
input = sys.stdin.buffer.readline

def solution():
	n = int(input())
	l = list(map(int, input().split()))
	if n == 1:
		print(1, 1)
		print(-1 * l[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	else:
		print(1, n - 1)
		for i in range(n - 1):
			x = l[i] % n
			print((n - 1) * x, end=' ')
			l[i] += x * (n - 1)
		print()
		print(n, n)
		print(-(l[n - 1] % n))
		l[n - 1] -= l[n - 1] % n
		l[n - 1] -= l[n - 1] % n
		print(1, n)
		for i in range(n):
			print(-1 * l[i])
		print()
t = 1
for _ in range(t):
	solution()


import sys
input = sys.stdin.readline
from collections import defaultdict
from math import sqrt
n = int(input())
lis = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-lis[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
m = n - 1
print(1, n)
for i in range(m):
	if lis[i] % m == 0:
		x = 0
	else:
		x = n * (m - lis[i] % m)
	print(x, end=' ')
	lis[i] += x
lis[-1] += n
print(n)
print(n, n)
print(-lis[-1])
lis[-1] = 0
print(1, m)
for i in range(m):
	print(-lis[i], end=' ')
print()


from sys import exit
n = int(input())
a = [int(i) for i in input().split()]
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit(0)
if n == 2:
	print(1, 1)
	print(-a[0])
	print(2, 2)
	print(-a[1])
	print(1, 1)
	print(0)
	exit(0)
print(2, n)
for i in range(1, n):
	print(a[i] % n * (n - 1), end=' ')
	a[i] += a[i] % n * (n - 1)
print()
print(1, n)
print(0, end=' ')
for i in range(1, n):
	print(-a[i], end=' ')
print()
print(1, 1)
print(-a[0])


import math
import os
import random
import re
import sys
from collections import defaultdict, Counter, deque
import heapq
from functools import lru_cache
from itertools import accumulate, chain, combinations, permutations, groupby, zip_longest
from math import floor, ceil, sqrt
L = int(input())
arr = list(map(int, input().split()))
if len(arr) == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-arr[0])
else:
	print(' '.join(map(str, [1, L - 1])))
	add = [arr[i] % L * (L - 1) for i in range(L - 1)]
	print(' '.join(map(str, add)))
	for i in range(L - 1):
		arr[i] += add[i]
	print(' '.join(map(str, [L, L])))
	print(-1 * (arr[-1] % L))
	arr[-1] += -1 * (arr[-1] % L)
	print(' '.join(map(str, [1, L])))
	print(' '.join(map(str, [-v for v in arr])))


n = int(input())
a = [int(i) for i in input().split()]
if n == 1:
	print(1, 1)
	print(-a[-1])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n)
	for i in range(n):
		k = (n - 1 - a[i]) * n
		a[i] += k
		print(k, sep=' ', end=' ')
	print()
	print(1, n - 1)
	for i in range(n - 1):
		print(-a[i], sep=' ', end=' ')
	print()
	print(n, n)
	print(-a[n - 1])


n = int(input())
l = list(map(int, input().split()))
print(1, 1)
print(-l[0])
if n == 1:
	for i in range(2):
		print(1, 1)
		print(0)
else:
	(v1, v2) = ([], [0])
	for i in range(1, n):
		v1.append(l[i] % n * (n - 1))
		l[i] += v1[-1]
		v2.append(-l[i])
	print(2, n)
	print(*v1)
	print(1, n)
	print(*v2)


from sys import stdin, stdout
input = stdin.readline

def main():
	t = 1
	for i in range(t):
		n = int(input())
		ai = list(map(int, input().split()))
		if n == 1:
			print(1, 1)
			print(0)
			print(1, 1)
			print(0)
			print(1, 1)
			print(int(-ai[0]))
			return
		print(1, n)
		n2 = n * (n - 1)
		ai2 = [n * (n - 1 - i % (n - 1)) for i in ai]
		print(*ai2)
		ai = [ai[i] + ai2[i] for i in range(n)]
		print(1, 1)
		print(int(-ai[0]))
		print(2, n)
		print(*[int(-ai[i]) for i in range(1, n)])
main()


import sys
input = sys.stdin.buffer.readline
n = int(input())
A = list(map(int, input().split()))
if n == 1:
	print('{} {}'.format(1, 1))
	print(0)
	print('{} {}'.format(1, 1))
	print(0)
	print('{} {}'.format(1, 1))
	print(-A[0])
else:
	print('{} {}'.format(2, n))
	for (i, a) in enumerate(A[1:]):
		print(a % n * (n - 1), end=' ')
		A[i + 1] += a % n * (n - 1)
	print()
	print('{} {}'.format(1, n))
	print(-n, end=' ')
	A[0] -= n
	for a in A[1:]:
		print(-1 * a, end=' ')
	print()
	print('{} {}'.format(1, 1))
	print(-1 * A[0])


n = int(input())
a = list(map(int, input().split()))
b = [i * n for i in a]
b.pop(0)
if n > 1:
	print('1 1')
	print(-a.pop(0))
	print('2', n)
	for i in range(n - 1):
		print(b[i] - a[i], end=' ')
	print('\n1', n)
	print('0', end=' ')
	for i in range(n - 1):
		print(-b[i], end=' ')
else:
	print('1 1')
	print(-a[0])
	print('1 1\n0\n1 1\n0')


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
print(1, n - 1)
b = []
for i in range(n - 1):
	if a[i] % n != 0:
		b.append((n - 1) * (a[i] + n))
	else:
		b.append(0)
print(*b)
if a[n - 1] % n == 0:
	print(1, 1)
	print(0)
else:
	print(n, n)
	print(n - a[n - 1])
print(1, n)
c = []
for i in range(n - 1):
	c.append(-a[i] - b[i])
if a[n - 1] % n == 0:
	c.append(-a[n - 1])
else:
	c.append(-n)
print(*c)


n = int(input())
arr = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-1 * arr[0])
else:
	print(1, n)
	for i in arr:
		print(-i * n, end=' ')
	print()
	print(1, n - 1)
	for i in arr[:n - 1]:
		print(i * (n - 1), end=' ')
	print()
	print(n, n)
	print(-arr[n - 1] + arr[n - 1] * n)


import sys
input = sys.stdin.readline
n = int(input())
arr = [int(el) for el in input().split()]
if n == 1:
	for i in range(3):
		print(1, 1)
		if i == 0:
			print(-arr[i])
		else:
			print(0)
else:
	print(2, n)
	for i in range(1, n):
		temp = arr[i] % n
		add = temp * (n - 1)
		arr[i] += add
		print(add, end=' ')
	print()
	print(1, n)
	for i in range(n):
		if i == 0:
			print(0, end=' ')
		else:
			print(-arr[i], end=' ')
	print()
	print(1, 1)
	print(-arr[0])


import sys

def rl(proc=None):
	if proc is not None:
		return proc(sys.stdin.readline())
	else:
		return sys.stdin.readline().rstrip()

def srl(proc=None):
	if proc is not None:
		return list(map(proc, rl().split()))
	else:
		return rl().split()

def solve(A):
	a = len(A)
	x1 = []
	x3 = []
	for x in A:
		x1.append((a - 1) * x)
		x3.append(a * -x)
	r1 = x1[:-1]
	r2 = [0] * (a - 1)
	r2[-1] = x1[-1]
	r3 = x3
	return [r1, r2, r3]

def main():
	rl()
	A = srl(int)
	n = len(A)
	if n == 1:
		print(1, 1)
		print(-A[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	r = solve(A)
	print(1, n - 1)
	print(*r[0])
	print(2, n)
	print(*r[1])
	print(1, n)
	print(*r[2])
main()


import sys
ll = lambda : list(map(int, input().split()))
lls = lambda : list(map(str, input().split()))
fin = lambda : list(map(float, input().split()))
st = lambda : input()
v = lambda : map(int, input().split())
ii = lambda : int(input())
mod = 10 ** 9 + 7
from math import *
from datetime import datetime
from collections import *
import math
x = ii()
l = ll()
if x < 3:
	if x == 1:
		print(1, 1)
		l[0] += 1
		print(1)
		print(1, 1)
		l[0] += 1
		print(1)
		print(1, 1)
		print(-l[0])
	else:
		print(1, 1)
		print(-l[0])
		if l[1] % 2:
			print(2, 2)
			print(1)
			l[1] += 1
			print(2, 2)
			print(-l[1])
		else:
			print(2, 2)
			print(0)
			print(2, 2)
			print(-l[1])
elif x == 3:
	print(1, 1)
	print(-l[0])
	print(2, 2)
	print(-l[1])
	print(3, 3)
	print(-l[2])
else:
	print(x, x)
	print(-l[-1])
	l[-1] = 0
	print(1, x - 1)
	sol = []
	for i in range(x - 1):
		sol.append((x - 1) * ((l[i] % x + x) % x))
		l[i] += sol[i]
	print(*sol)
	print(1, x)
	ans = []
	for i in range(x):
		ans.append(-l[i])
	print(*ans)


import os
from io import BytesIO, IOBase
import sys

def main():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print('1 1')
		print('0')
		print('1 1')
		print('0')
		print('1 1')
		print(-a[0])
		pass
	else:
		print(1, n - 1)
		for i in range(n - 1):
			t = (n - 1) * (a[i] % n)
			print(t, end=' ')
			a[i] += t
		print()
		print(n, n)
		print(-(a[-1] % n), end=' ')
		a[-1] += -(a[-1] % n)
		print()
		print(1, n)
		for i in range(n):
			print(n * -(a[i] // n), end=' ')
		print()
	return
BUFSIZE = 1048576

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))

def input():
	return sys.stdin.readline().rstrip('\r\n')
main()


n = int(input())
A = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-A[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
print(1, n)
print(*(-n * a for a in A))
print(1, n - 1)
print(*((n - 1) * A[i] for i in range(n - 1)))
print(n, n)
print((n - 1) * A[-1])


rw = 1
for wewq in range(rw):
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		continue
	print(1, n)
	for i in range(n):
		d = n - 1 - a[i] % (n - 1)
		print(d * n, end=' ')
		a[i] = a[i] + d * n
	print('')
	print(1, n - 1)
	for i in range(n - 1):
		print(-a[i], end=' ')
	print('')
	print(2, n)
	for i in range(n - 2):
		print(0, end=' ')
	print(-a[n - 1])


n = int(input())
s = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-s[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-s[0])
	print(2, n)
	tmp = [0] * n
	for i in range(1, n):
		tmp[i] = (n - 1) * s[i]
	print(*tmp[1:])
	print(1, n)
	tmp = [0] * n
	for i in range(1, n):
		tmp[i] = -s[i] * n
	print(*tmp)


n = int(input())
a = [int(X) for X in input().split()]
if n <= 3:
	if n == 3:
		print(1, 1)
		print(a[0] * -1)
		print(3, 3)
		print(a[2] * -1)
		print(2, 2)
		print(a[1] * -1)
	elif n == 2:
		print(1, 1)
		print(-1 * a[0])
		print(1, 1)
		print(0)
		print(2, 2)
		print(-1 * a[1])
	else:
		print(1, 1)
		print(a[0] * -1)
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
else:
	print(1, n)
	for i in range(n):
		print(-1 * n * a[i], end=' ')
		a[i] = a[i] - n * a[i]
	print()
	print(1, n - 1)
	for i in range(n - 1):
		print(-1 * a[i], end=' ')
	print()
	print(n, n)
	print(-1 * a[n - 1])


from sys import stdin

class Input:

	def __init__(self):
		self.next = self.readline()

	def readline(self):
		return stdin.readline().strip()

	def line(self):
		try:
			return self.next
		finally:
			self.next = self.readline()

	def array(self, sep=' ', cast=int):
		return list(map(cast, self.line().split(sep=sep)))

	def known_tests(self):
		(num_of_cases,) = self.array()
		for case in range(num_of_cases):
			yield self

	def unknown_tests(self):
		while self.next:
			yield self

class Problem:

	def __init__(self, input):
		(n,) = input.array()
		a = input.array()
		if n == 1:
			print(1, 1)
			print(0)
		else:
			print(2, n)
			print(*tuple([a[i] * (n - 1) for i in range(1, n)]))
		print(1, n)
		print(*tuple([-a[i] * n for i in range(n)]))
		print(1, 1)
		print(-(a[0] - a[0] * n))
for tc in Input().unknown_tests():
	Problem(tc)


from sys import stdin, stdout
from math import gcd, sqrt, factorial, pi
from collections import deque, defaultdict
input = stdin.readline
R = lambda : map(int, input().split())
I = lambda : int(input())
S = lambda : input().rstrip('\n')
L = lambda : list(R())
P = lambda x: stdout.write(x)
lcm = lambda x, y: x * y // gcd(x, y)
hg = lambda x, y: (y + x - 1) // x * x
pw = lambda x: 1 if x == 1 else 1 + pw(x // 2)
chk = lambda x: chk(x // 2) if not x % 2 else True if x == 1 else False
sm = lambda x: (x ** 2 + x) // 2
N = 10 ** 9 + 7
n = I()
(*a,) = R()
if n == 1:
	print(f'1 1\n{-a[0]}\n1 1\n0\n1 1\n0')
	exit()
print(1, n - 1)
print(*[i * (n - 1) for i in a[:-1]])
print(1, n)
print(*[-i * n for i in a])
print(n, n)
print(0 - (a[n - 1] - a[n - 1] * n))


def solve():
	if N == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		print(1, 1)
		print(-A[0])
	else:
		print(1, 1)
		print(-A[0])
		A[0] = 0
		print(2, N)
		s = ''
		for i in range(1, N):
			if i > 1:
				s += ' '
			val = A[i] % N * (N - 1)
			s += str(val)
			A[i] += val
		print(s)
		print(1, N)
		s = ''
		for i in range(N):
			if i > 0:
				s += ' '
			s += str(-A[i])
		print(s)
N = int(input())
A = [int(s) for s in input().split()]
solve()


import math
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])
else:
	print(1, n - 1)
	for i in range(n - 1):
		print((n - 1) * (a[i] % n), end=' ')
		a[i] += (n - 1) * (a[i] % n)
	print()
	print(2, n)
	for i in range(1, n):
		print((n - 1) * (a[i] % n), end=' ')
		a[i] += (n - 1) * (a[i] % n)
	print()
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')


import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	for _ in range(3):
		print(1, 1)
		print(-a[0])
		a[0] = 0
	exit(0)
print(1, 1)
print(-a[0])
a[0] = 0
print(2, n)
res = [0] * n
for i in range(1, n):
	res[i] += a[i] % n * (n - 1)
	a[i] += a[i] % n * (n - 1)
print(*res[1:])
print(1, n)
res = [0] * n
for i in range(n):
	res[i] = -a[i]
print(*res)


import sys
input = sys.stdin.readline
I = lambda : list(map(int, input().split()))
(n,) = I()
l = I()
if n == 1:
	s = '1 1\n' + str(-l[0]) + '\n1 1\n0\n1 1\n0'
	print(s)
else:
	a = []
	an = []
	for i in range(n):
		an.append(-l[i] * n)
	b = -(l[0] + an[0])
	for i in range(1, n):
		a.append(l[i] * (n - 1))
	print(1, n)
	print(*an)
	print(1, 1)
	print(b)
	print(2, n)
	print(*a)


def sol():
	n = int(input())
	arr = list(map(int, input().split()))
	if n == 1:
		print(1, 1)
		print(-1 * arr[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return 0
	print(n, n)
	print(-1 * arr[n - 1])
	arr[-1] = 0
	print(1, n - 1)
	for i in range(n - 1):
		print((n - 1) * arr[i], end=' ')
		arr[i] += (n - 1) * arr[i]
	print('\n' + '1', n)
	for i in range(n):
		print(-1 * arr[i], end=' ')
sol()


import sys, io, os, time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect, math, heapq
alphabet = 'abcdefghijklmnopqrstuvwxyz'
input = sys.stdin.readline
n = int(input())
arr = list(map(int, input().split()))
if n == 1:
	print('1 1')
	print(0)
	print('1 1')
	print(0)
	print('1 1')
	print(-arr[0])
else:
	print(1, n)
	print(*[-i * n for i in arr])
	print(1, n - 1)
	print(*[arr[i] * (n - 1) for i in range(n - 1)])
	print(2, n)
	for i in range(1, n - 1):
		print('0', end=' ')
	print(arr[n - 1] * (n - 1))


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(0 - a[0])
else:
	x = []
	for i in range(1, n + 1):
		x.append((n - 1) * i)
	x.reverse()
	print(1, n - 1)
	for i in range(n - 1):
		if a[i] % n > 0:
			print(x[n - a[i] % n], end=' ')
			a[i] += x[n - a[i] % n]
		else:
			print(0, end=' ')
	print('')
	print(n, n)
	print(n - a[n - 1] % n)
	a[n - 1] += n - a[n - 1] % n
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')


def solve():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print(1, 1)
		print(-a[0])
		for _ in range(2):
			print(1, 1)
			print(0)
	else:
		print(1, n)
		for i in a:
			print(-i * n, end=' ')
		print('')
		print(1, n - 1)
		for i in range(n - 1):
			print(a[i] * (n - 1), end=' ')
		print('')
		print(n, n)
		print(a[-1] * (n - 1))
solve()


import sys
import math
input = lambda : sys.stdin.readline().rstrip('\r\n')
n = int(input())
ar = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(ar[0] * -1)
	print(1, 1)
	print(1)
	print(1, 1)
	print(-1)
	sys.exit(0)
arMod = [0] * n
print(1, n)
for i in range(n):
	ans = 0
	mult = abs(ar[i]) // n + (1 if ar[i] % n != 0 else 0)
	temp2 = abs(ar[i]) - mult * n
	mult2 = n - 1 - abs(temp2)
	if mult2 == 0:
		mult2 = n - 1
	mult += mult2
	if ar[i] >= 0:
		print(-mult * n, end=' ')
		arMod[i] = ar[i] - mult * n
	else:
		arMod[i] = ar[i] + mult * n
		print(mult * n, end=' ')
print()
print(1, n - 1)
print(arMod[0] * -1, end=' ')
for i in range(1, n - 1):
	print(arMod[i] * -1, end=' ')
	arMod[i] = 0
print()
print(2, n)
for i in range(1, n - 1):
	print(arMod[i] * -1, end=' ')
print(arMod[n - 1] * -1)


from sys import stdin
from math import ceil, gcd

def func():
	return
n = int(stdin.readline())
arr = list(map(int, stdin.readline().split()))
if n == 1:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n - 1)
	ans = []
	for i in range(n - 1):
		if arr[i] % n == 0:
			ans.append(0)
		else:
			ans.append((n - 1) * arr[i])
			arr[i] += (n - 1) * arr[i]
	print(*ans)
	print(2, n)
	ans = []
	for i in range(1, n):
		if arr[i] % n == 0:
			ans.append(0)
		else:
			ans.append((n - 1) * arr[i])
			arr[i] += (n - 1) * arr[i]
	print(*ans)
	print(1, n)
	ans = []
	for i in range(n):
		ans.append(-arr[i])
	print(*ans)


import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import *
from io import BytesIO, IOBase

def vsInput():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
ALPHA = 'abcdefghijklmnopqrstuvwxyz'
M = 998244353
EPS = 1e-06

def value():
	return tuple(map(int, input().split()))

def array():
	return [int(i) for i in input().split()]

def Int():
	return int(input())

def Str():
	return input()

def arrayS():
	return [i for i in input().split()]
n = Int()
a = array()
to_make_multiple_n = []
to_make_0 = []
for i in range(n - 1):
	mod = a[i] % n
	to_make_multiple_n.append((n - 1) * mod)
	now = a[i] + (n - 1) * mod
	to_make_0.append(0 - now)
to_make_0.append(0)
if n == 1:
	to_make_multiple_n.append(0)
print(n, n)
print(0 - a[-1])
print(1, len(to_make_multiple_n))
print(*to_make_multiple_n)
print(1, len(to_make_0))
print(*to_make_0)


n = int(input())
mas = [int(_) for _ in input().split()]
if n == 1:
	print(1, 1)
	print(-mas[0])
	print('1 1\n0\n1 1\n0')
else:
	print(1, n)
	for i in mas:
		print(-i * n, end=' ')
	print()
	print(1, n - 1)
	for i in mas[:-1]:
		print(i * (n - 1), end=' ')
	print()
	print(n, n)
	print(mas[-1] * n - mas[-1])


from sys import stdin, stdout
n = int(stdin.readline())
l = list(map(int, stdin.readline().split()))
if n == 1:
	stdout.write(f'1 1\n{-l[0]}\n1 1\n0\n1 1\n0')
else:
	stdout.write(f'1 1\n{-l[0]}\n2 {n}\n')
	for i in range(1, n):
		x = l[i] % n
		stdout.write(str(x * (n - 1)) + ' ')
		l[i] += x * (n - 1)
	stdout.write(f'\n1 {n}\n0')
	for i in range(1, n):
		stdout.write(f' {-l[i]}')


import sys
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	sys.exit()
print(1, n - 1)
ans = []
for i in range(n - 1):
	l = a[i] % n
	ans.append(str(l * (n - 1)))
	a[i] += l * (n - 1)
print(' '.join(ans))
print(n, n)
print(-a[n - 1])
a[n - 1] = 0
print(1, n)
ans = []
for i in range(n):
	ans.append(str(-a[i]))
print(' '.join(ans))


import sys
LI = lambda : list(map(int, sys.stdin.readline().strip('\n').split()))
MI = lambda : map(int, sys.stdin.readline().strip('\n').split())
SI = lambda : sys.stdin.readline().strip('\n')
II = lambda : int(sys.stdin.readline().strip('\n'))
n = II()
a = LI()
if n == 1:
	print(1, 1)
	print(a[0])
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(-a[0])
	exit()
print(1, 1)
print((n - 1) * a[0])
print(2, n)
print(*[(n - 1) * a[i] for i in range(1, n)])
print(1, n)
print(*[-n * a[i] for i in range(n)])


import sys
import heapq, functools, collections
import math, random
from collections import Counter, defaultdict

@functools.lru_cache(maxsize=None)
def invmod(a, b):
	return 0 if a == 0 else 1 if b % a == 0 else b - invmod(b % a, a) * b // a

def solve(lst):
	console('----- solving ------')
	if len(lst) == 1:
		print('1 1')
		print(0)
		print('1 1')
		print(0)
		print('1 1')
		print(-lst[0])
		return
	length = len(lst)
	inv = invmod(length, length - 1)
	console(inv)
	arr = [x * (length - 1) for x in lst[1:]]
	console(arr)
	print('{} {}'.format(2, length))
	print(' '.join((str(x) for x in arr)))
	lst[1:] = [a + b for (a, b) in zip(arr, lst[1:])]
	diff = lst[0] % len(lst)
	if diff == 0:
		print('1 1')
		print(0)
	else:
		print('{} {}'.format(1, diff))
		print('{} '.format(-diff) + ' '.join(['0' for i in range(diff - 1)]))
	lst[0] = lst[0] - diff
	assert all((x % length == 0 for x in lst))
	print('{} {}'.format(1, length))
	print(' '.join([str(-x) for x in lst]))
	return

def console(*args):
	print('\x1b[36m', *args, '\x1b[0m', file=sys.stderr)
	return
for _ in [1]:
	_ = int(input())
	lst = list(map(int, input().split()))
	solve(lst)


from __future__ import division, print_function
from sys import stdin, stdout
import bisect
import math
import heapq
i_m = 9223372036854775807

def inin():
	return int(input())

def stin():
	return input()

def spin():
	return map(int, stin().split())

def lin():
	return list(map(int, stin().split()))

def matrix(n):
	return [list(map(int, input().split())) for i in range(n)]

def string2intlist(s):
	return list(map(int, s))

def calculate_sum(a, N):
	m = N / a
	sum = m * (m + 1) / 2
	ans = a * sum
	return ans

def series(N):
	return N * (N + 1) // 2

def count2Dmatrix(i, list):
	return sum((c.count(i) for c in list))

def modinv(n, p):
	return pow(n, p - 2, p)

def GCD(x, y):
	x = abs(x)
	y = abs(y)
	if min(x, y) == 0:
		return max(x, y)
	while y:
		(x, y) = (y, x % y)
	return x

def LCM(x, y):
	return x * y // GCD(x, y)

def Divisors(n):
	l = []
	for i in range(1, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
	return l

def isprime(n):
	for i in range(2, int(math.sqrt(n)) + 1):
		if n % i == 0:
			return False
	return True
prime = []

def SieveOfEratosthenes(n):
	global prime
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	f = []
	for p in range(2, n):
		if prime[p]:
			f.append(p)
	return f
q = []

def dfs(n, d, v, c):
	global q
	v[n] = 1
	x = d[n]
	q.append(n)
	j = c
	for i in x:
		if i not in v:
			f = dfs(i, d, v, c + 1)
			j = max(j, f)
	return j
n = inin()
l = lin()
if n == 1:
	print(1, 1)
	print(-l[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n)
	print(' '.join([str(-n * i) for i in l]))
	print(1, n - 1)
	print(' '.join([str((n - 1) * i) for i in l[:n - 1]]))
	print(2, n)
	print(' '.join([str(0) for i in range(n - 2)] + [str((n - 1) * l[-1])]))


from sys import stdin, stdout
mp = lambda : map(int, stdin.readline().split())
li = lambda : list(map(int, stdin.readline().split()))
n = int(input())
a = li()
if n == 1:
	print(1, 1)
	print(-1 * a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-a[0])
	a[0] = 0
	print(2, n)
	print(*[i * (n - 1) for i in a[1:]])
	print(1, n)
	print(*[0] + [-i * n for i in a[1:]])


from math import *
n = int(input())
a = list(map(int, input().split()))
if n != 1:
	print(1, n)
	for i in range(n):
		x = n - 1 - a[i] % (n - 1)
		y = x + x * (n - 1)
		a[i] += y
		print(y, end=' ')
	print()
	print(1, n - 1)
	for i in range(n - 1):
		print(-a[i], end=' ')
	print()
	print(n, n)
	print(-a[n - 1])
else:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(+a[0])
	print(1, 1)
	print(-a[0])


n = int(input())
a = list(map(int, input().split()))
print('1 1')
print(-a[0])
if n == 1:
	print('1 1\n0\n1 1\n0')
else:
	print(2, n)
	print(' '.join((str((n - 1) * (x % n)) for x in a[1:])))
	print(1, n)
	print(0, ' '.join((str(n * (-(x // n) - x % n)) for x in a[1:])))


n = int(input())
sequence = list(map(int, input().split()))
print('1 1')
print(-1 * sequence[0])
if n > 1:
	print(2, n)
	output = ''
	for ele in sequence[1:]:
		output += str((n - 1) * (ele % n)) + ' '
	print(output[:-1])
	print(1, n)
	output = '0 '
	for ele in sequence[1:n]:
		output += str(-1 * (ele + (n - 1) * (ele % n))) + ' '
	print(output[:-1])
else:
	print('1 1\n0\n1 1\n0')


n = int(input())
a = list(map(int, input().split()))
if n != 1:
	print(n, n)
	print(-a[-1])
	print(1, n - 1)
	res_2 = [a[i] * (n - 1) for i in range(n - 1)]
	print(*res_2)
	print(1, n)
	res_3 = [-a[i] * n for i in range(n)]
	res_3[-1] = 0
	print(*res_3)
else:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


n = int(input())
a = list(map(int, input().split()))

def egcd(a, b):
	if a == 0:
		return (b, 0, 1)
	else:
		(g, y, x) = egcd(b % a, a)
		return (g, x - b // a * y, y)

def modinv(a, m):
	(g, x, y) = egcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m
if n == 1:
	i = 0
	print(1, 1)
	print(-1 * a[i])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit(0)
print(1, n - 1)
for i in range(n - 1):
	tba = -a[i] % n * modinv(n - 1, n) % n * (n - 1)
	a[i] += tba
	print(tba, end=' ')
print()
print(2, n)
for i in range(1, n):
	tba = -a[i] % n * modinv(n - 1, n) * (n - 1)
	a[i] += tba
	print(tba, end=' ')
print()
print(1, n)
for i in range(n):
	tba = a[i] * -1
	print(tba, end=' ')
print()


n = int(input())
l = list(map(int, input().split()))[:n]
h = [0] * (n - 1)
j = [0] * (n - 1)
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-1 * l[0])
elif n == 2:
	print(1, 1)
	print(l[0] % 2 * 1)
	print(2, 2)
	print(l[1] % 2 * 1)
	print(1, 2)
	l[0] = l[0] + l[0] % 2 * 1
	l[1] = l[1] + l[1] % 2 * 1
	print(-1 * l[0], -1 * l[1])
else:
	for i in range(n - 1):
		h[i] = l[i] % n * (n - 1)
		l[i] += l[i] % n * (n - 1)
	for i in range(n - 1):
		j[i] = l[i + 1] % n * (n - 1)
		l[i + 1] += l[i + 1] % n * (n - 1)
	for i in range(n):
		l[i] = l[i] * -1
	print(1, n - 1)
	print(*h)
	print(2, n)
	print(*j)
	print(1, n)
	print(*l)


n = int(input())
a = list(map(int, input().split()))
print('1 {}'.format(max(1, n - 1)))
for i in range(0, max(1, n - 1)):
	print((n - 1) * a[i], end=' ')
print('')
print('{} {}'.format(n, n))
print((n - 1) * a[n - 1])
print('1 {}'.format(n))
for i in range(0, n):
	print(-1 * n * a[i], end=' ')
print('')


import sys
cases = False

def c2(n):
	return n * (n - 1) // 2

def get():
	return list(map(int, input().split()))

def bits(n: int):
	return list(bin(n)).count('1')

def main(test_case=False):
	n = int(input()) if test_case else 1
	for _ in range(n):
		test()

def flush():
	sys.stdout.flush()

def parr(arr):
	print(*arr, sep=' ')

def gcd(a, b):
	while b:
		if b % a == 0:
			break
		tmp = a
		a = b % a
		b = tmp
	return a

def ext_gcd(a: int, b: int):
	if b == 0:
		return [a, [1, 0]]
	res = ext_gcd(b, a % b)
	g = res[0]
	x1 = res[1][0]
	y1 = res[1][1]
	x = y1
	y = x1 - y1 * (a // b)
	return [g, [x, y]]

def test():
	n = int(input())
	a = get()
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		print(1, 1)
		print(-a[0])
		return
	print(1, 1)
	print(-a[0])
	a[0] = 0
	k = ext_gcd(n, n - 1)
	print(2, n)
	for i in range(n - 1):
		temp = -k[1][1] * a[i + 1] * (n - 1)
		a[i + 1] += temp
		print(temp, end=' ')
	print('')
	print(1, n)
	for i in range(n):
		print(-a[i], ' ')
main(cases)


def main():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	elif n == 2:
		print(1, 1)
		print(-a[0])
		print(2, 2)
		print(-a[1])
		print(1, 1)
		print(0)
	else:
		print(1, 1)
		print(-a[0])
		print(2, n)
		print(*[a[i] * (n - 1) for i in range(1, n)])
		print(1, n)
		print(0, end=' ')
		print(*[a[j] * -n for j in range(1, n)])
main()


import sys
import math
n = int(sys.stdin.readline().strip())
nums = list(map(int, sys.stdin.readline().strip().split()))
if n == 1:
	print('1 1')
	print('0')
	print('1 1')
	print('0')
	print('1 1')
	print(-1 * nums[0])
elif n == 2:
	print('1 1')
	print(-1 * nums[0])
	print('2 2')
	print(-1 * nums[-1])
	print('1 1')
	print(0)
else:
	splits = n // 2 + 1
	while math.gcd(n, splits) != 1:
		splits += 1
	cycles = {0: 0}
	cur = splits
	run = -splits
	while cur not in cycles:
		cycles[cur] = run
		cur += splits
		cur %= n
		run -= splits
	print('1 {}'.format(splits))
	res = []
	for i in range(splits):
		diff = nums[i] % n
		res.append(cycles[diff])
		nums[i] += cycles[diff]
	print(' '.join(map(str, res)))
	print('{} {}'.format(n - splits + 1, n))
	res = []
	for i in range(n - splits, n):
		diff = nums[i] % n
		res.append(cycles[diff])
		nums[i] += cycles[diff]
	print(' '.join(map(str, res)))
	print('1 {}'.format(n))
	res = []
	for i in range(n):
		res.append(-1 * nums[i])
	print(' '.join(map(str, res)))


import sys
input = sys.stdin.readline
n = int(input())
a = [int(x) for x in input().split()]
print(1, n)
if n == 1:
	print(-a[0])
	for x in range(2):
		print(1, 1)
		print(0)
	sys.exit()
for x in range(n):
	now = a[x] % (n - 1)
	if now == 0:
		print(0, end=' ')
		continue
	now = n - 1 - now
	a[x] += n * now
	print(n * now, end=' ')
print()
print(1, n - 1)
for x in a[:-1]:
	print(-x, end=' ')
print()
print(n, n)
print(-a[-1])


import os
import heapq
import sys, threading
import math
import operator
from collections import defaultdict, deque
from io import BytesIO, IOBase
sys.setrecursionlimit(10 ** 5)
threading.stack_size(2 ** 27)

def gcd(a, b):
	if b == 0:
		return a
	else:
		return gcd(b, a % b)

def pw(a, b):
	result = 1
	while b > 0:
		if b % 2 == 1:
			result *= a
		a *= a
		b //= 2
	return result

def inpt():
	return [int(k) for k in input().split()]

def main():
	n = int(input())
	ar = inpt()
	if n == 1:
		for i in range(3):
			print(1, 1)
			if ar[0] != 0:
				print(-ar[0])
				ar[0] = 0
			else:
				print(0)
	else:
		print(1, 1)
		print(-ar[0])
		ar[0] = 0
		print(2, n)
		for i in range(1, n):
			print(ar[i] * (n - 1), end=' ')
			ar[i] += ar[i] * (n - 1)
		print()
		print(1, n)
		for i in range(n):
			print(-ar[i], end=' ')
		print()
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


n = int(input())
arr = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit(0)
first = arr[0]
other = arr[1:]
xs = [0] + [-1 * n * a for a in other]
ys = [(n - 1) * a for a in other]
print(1, 1)
print(-first)
print(1, n)
print(' '.join(map(str, xs)))
print(2, n)
print(' '.join(map(str, ys)))


n = int(input())
A = list(map(int, input().split()))
X = [-n * i for i in A]
print('1 {}'.format(str(n)))
print(*X)
if n > 1:
	Y = [(n - 1) * i for i in A[1:]]
	print('2 {}'.format(str(n)))
	print(*Y)
	print('1 1')
	print(str((n - 1) * A[0]))
else:
	print('1 1')
	print(0)
	print('1 1')
	print(0)


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(a[0] * -1)
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n)
	ans = []
	for i in range(n):
		ans.append(a[i] * -1 * n)
	print(*ans)
	print(1, n - 1)
	res = []
	for i in range(n - 1):
		res.append(a[i] * (n - 1))
	print(*res)
	print(n, n)
	print(a[-1] * (n - 1))


n = int(input())
if n != 1:
	arr = list(map(int, input().split()))
	print(1, 1)
	print(arr[0] * -1)
	print(2, n)
	secondprint = [0 for i in range(n - 1)]
	for i in range(1, n):
		j = arr[i] % n
		secondprint[i - 1] = j * (n - 1)
	print(' '.join(map(str, secondprint)))
	print(1, n)
	thirdprint = [0 for i in range(n)]
	for j in range(1, n):
		thirdprint[j] = (secondprint[j - 1] + arr[j]) * -1
	print(' '.join(map(str, thirdprint)))
else:
	n = int(input())
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-1 * n)


N = int(input())
List = [int(x) for x in input().split()]
if N == 1:
	print(1, 1)
	print(-List[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	Needed = []
	print(1, 1)
	print(N - List[0] % N)
	Needed.append(N - List[0] % N)
	print(2, N)
	for i in range(1, N):
		Needed.append(N - List[i] % N)
	print(*[(N - 1) * (N - i) for i in Needed[1:N]])
	print(1, N)
	New = []
	print(-Needed[0] - List[0], end=' ')
	for i in range(1, N):
		New.append(-(List[i] + (N - Needed[i]) * (N - 1)))
	print(*New)


a = int(input())
arr = list(map(int, input().split()))
l = len(arr)
if len(arr) == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-arr[0])
else:
	print(2, len(arr))
	ans = []
	for i in range(1, len(arr)):
		n = arr[i] % l
		ans.append(n * (len(arr) - 1))
		arr[i] = arr[i] + n * (len(arr) - 1)
	print(' '.join(map(str, ans)))
	print(1, 1)
	print(-arr[0])
	arr[0] = 0
	print(1, len(arr))
	ans = []
	for i in arr:
		ans.append(-i)
	print(' '.join(map(str, ans)))


import math, sys
from collections import defaultdict, Counter, deque
INF = float('inf')
MOD = 10 ** 9 + 7

def gcd(a, b):
	while b:
		(a, b) = (b, a % b)
	return a

def isPrime(n):
	if n <= 1:
		return False
	i = 2
	while i ** 2 <= n:
		if n % i == 0:
			return False
		i += 1
	return True

def primeFactors(n):
	factors = defaultdict(int)
	i = 2
	while i ** 2 <= n:
		while n % i == 0:
			factors[i] += 1
			n //= i
		i += 1
	if n > 1:
		factors[n] += 1
	return factors

def vars():
	return map(int, input().split())

def array():
	return list(map(int, input().split()))

def main():
	n = int(input())
	arr = array()
	if n == 1:
		print(1, 1)
		print(-arr[-1])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	else:
		print(1, n - 1)
		p = []
		for i in range(n - 1):
			p.append(arr[i] * (n - 1))
			arr[i] += arr[i] * (n - 1)
		print(*p)
		print(n, n)
		print(-arr[-1])
		arr[-1] = 0
		p = []
		print(1, n)
		for i in range(n):
			p.append(-(arr[i] // n) * n)
		print(*p)
t = 1
for _ in range(t):
	main()


n = int(input())
l = list(map(int, input().split()))
if n == 1:
	for i in range(3):
		print(1, 1)
		print(-1 * l[0])
		l[0] = l[0] * -1
else:
	n1 = n - 1
	print(1, n - 1)
	for i in range(n - 1):
		print(l[i] % n * n1, end=' ')
		l[i] += l[i] % n * n1
	print()
	print(n, n)
	print(n - l[n - 1] % n)
	l[n - 1] += n - l[n - 1] % n
	print(1, n)
	for i in range(n):
		print(-1 * l[i], end=' ')
	print()


n = int(input())
A = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-A[0])
	exit()
if A[-1] != n:
	print(n, n)
	print(n - A[-1])
	A[-1] = n
	print(1, n - 1)
	res = []
	for i in range(n - 1):
		res.append((n - 1) * A[i])
	print(*res)
	print(1, n)
	res = []
	for i in range(n - 1):
		res.append(-n * A[i])
	res.append(-A[-1])
	print(*res)
else:
	print(1, 1)
	print(0)
	print(1, n - 1)
	res = []
	for i in range(n - 1):
		res.append((n - 1) * A[i])
	print(*res)
	print(1, n)
	res = []
	for i in range(n - 1):
		res.append(-n * A[i])
	res.append(-A[-1])
	print(*res)


from sys import stdin, stdout, setrecursionlimit
from math import gcd, ceil, sqrt
from collections import Counter, deque
from bisect import bisect_left, bisect_right
ii1 = lambda : int(stdin.readline().strip())
is1 = lambda : stdin.readline().strip()
iia = lambda : list(map(int, stdin.readline().strip().split()))
isa = lambda : stdin.readline().strip().split()
setrecursionlimit(100000)
mod = 1000000007
n = ii1()
arr = iia()
temp1 = []
if n == 1:
	print(1, 1)
	print(arr[0])
	arr[0] += arr[0]
	print(1, 1)
	print(0)
	print(1, 1)
	print(-1 * arr[0])
else:
	for i in range(n - 1):
		temp1.append((n - 1) * arr[i])
		arr[i] += temp1[i]
	temp2 = [0] * (n - 2) + [(n - 1) * arr[-1]]
	arr[-1] += temp2[-1]
	temp3 = []
	for i in range(n):
		temp3.append(-1 * arr[i])
	print(1, n - 1)
	print(*temp1)
	print(2, n)
	print(*temp2)
	print(1, n)
	print(*temp3)


import sys
(_ord, inp, num, neg, _Index) = (lambda x: x, [], 0, False, 0)
(i, s) = (0, sys.stdin.buffer.read())
try:
	while True:
		if s[i] >= b'0'[0]:
			num = 10 * num + _ord(s[i]) - 48
		elif s[i] == b'-'[0]:
			neg = True
		elif s[i] != b'\r'[0]:
			inp.append(-num if neg else num)
			(num, neg) = (0, False)
		i += 1
except IndexError:
	pass
if s and s[-1] >= b'0'[0]:
	inp.append(-num if neg else num)

def fin(size=None):
	global _Index
	if size == None:
		ni = _Index
		_Index += 1
		return inp[ni]
	else:
		ni = _Index
		_Index += size
		return inp[ni:ni + size]
_T_ = 1
for _t_ in range(_T_):
	n = fin()
	a = fin(n)
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		break
	print(n, n)
	print(-a[-1])
	a[-1] -= a[-1]
	print(1, n - 1)
	for i in range(n - 1):
		print(a[i] * (n - 1), end=' ')
		a[i] += a[i] * (n - 1)
	print()
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')
		a[i] -= a[i]
	print()


import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
n = int(input())
arry = list(map(int, input().split()))
if n == 1:
	print('1 1')
	print(1)
	print('1 1')
	print(1)
	print('1 1')
	print(-arry[0] - 2)
else:
	print('1 {}'.format(n - 1))
	tem = []
	for i in range(n - 1):
		tem.append(arry[i] * (n - 1))
	print(' '.join((str(x) for x in tem)))
	print('{} {}'.format(n, n))
	print(arry[n - 1] * (n - 1))
	print('1 {}'.format(n))
	temRes = []
	for i in range(n):
		temRes.append(-arry[i] * n)
	print(' '.join((str(x) for x in temRes)))


n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-1 * l[0])
	exit()
else:
	print(1, 1)
	print(-1 * l[0])
	print(1, n)
	o = [0]
	for i in range(1, len(l)):
		o.append(-1 * len(l) * l[i])
	print(*o)
	print(2, n)
	o = []
	for i in range(1, len(l)):
		o.append((len(l) - 1) * l[i])
	print(*o)


import math
t = int(input())
l = list(map(int, input().split()))
if t == 1:
	print(1, 1)
	print(-l[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	f = []
	s = []
	th = []
	for j in range(t - 1):
		r = l[j] % t
		f.append((t - 1) * r)
		l[j] += (t - 1) * r
	s.append(-l[-1])
	l[-1] = 0
	for j in range(t):
		th.append(-l[j])
	print(1, t - 1)
	print(*f)
	print(t, t)
	print(*s)
	print(1, t)
	print(*th)


import bisect
import decimal
from decimal import Decimal
import os
from collections import Counter
import bisect
from collections import defaultdict
import math
import random
import heapq
from math import sqrt
import sys
from functools import reduce, cmp_to_key
from collections import deque
import threading
from itertools import combinations
from io import BytesIO, IOBase
from itertools import accumulate
decimal.getcontext().prec = 46

def primeFactors(n):
	prime = set()
	while n % 2 == 0:
		prime.add(2)
		n = n // 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			prime.add(i)
			n = n // i
	if n > 2:
		prime.add(n)
	return list(prime)

def getFactors(n):
	factors = []
	i = 1
	while i <= math.sqrt(n):
		if n % i == 0:
			if n // i == i:
				factors.append(i)
			else:
				factors.append(i)
				factors.append(n // i)
		i = i + 1
	return factors

def modefiedSieve():
	mx = 10 ** 7 + 1
	sieve = [-1] * mx
	for i in range(2, mx):
		if sieve[i] == -1:
			sieve[i] = i
			for j in range(i * i, mx, i):
				if sieve[j] == -1:
					sieve[j] = i
	return sieve

def SieveOfEratosthenes(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	num = []
	for p in range(2, n + 1):
		if prime[p]:
			num.append(p)
	return num

def lcm(a, b):
	return a * b // math.gcd(a, b)

def sort_dict(key_value):
	return sorted(key_value.items(), key=lambda kv: (kv[1], kv[0]))

def list_input():
	return list(map(int, input().split()))

def num_input():
	return map(int, input().split())

def string_list():
	return list(input())

def decimalToBinary(n):
	return bin(n).replace('0b', '')

def binaryToDecimal(n):
	return int(n, 2)

def DFS(n, s, adj):
	visited = [False for i in range(n + 1)]
	stack = []
	stack.append(s)
	while len(stack):
		s = stack[-1]
		stack.pop()
		if not visited[s]:
			visited[s] = True
		for node in adj[s]:
			if not visited[node]:
				stack.append(node)

def maxSubArraySum(a, size):
	maxint = 10 ** 10
	max_so_far = -maxint - 1
	max_ending_here = 0
	for i in range(0, size):
		max_ending_here = max_ending_here + a[i]
		if max_so_far < max_ending_here:
			max_so_far = max_ending_here
		if max_ending_here < 0:
			max_ending_here = 0
	return max_so_far

def solve():
	n = int(input())
	arr = list_input()
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		print(1, 1)
		print(-1 * arr[0])
		return
	x = n - 1
	(start, end) = (0, n - 1)
	for _ in range(2):
		print(start + 1, end)
		for i in range(start, end):
			if arr[i] % n != 0:
				print(arr[i] * x, end=' ')
				arr[i] += arr[i] * x
			else:
				print(0, end=' ')
		print()
		start += 1
		end += 1
	print(1, n)
	for i in arr:
		print(-1 * i, end=' ')
	print()
t = 1
for _ in range(t):
	solve()


import sys
input = sys.stdin.buffer.readline
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])
	exit()
res = []
length = n - 1
print(1, n - 1)
for i in range(n - 1):
	add = a[i] % n
	res.append(length * add)
	a[i] += length * add
print(*res)
res = []
length = n
print(1, n)
for i in range(n):
	if i == n - 1:
		res.append(0)
		continue
	res.append(-a[i])
	a[i] -= a[i]
print(*res)
print(n, n)
print(-a[-1])


import sys

def minp():
	return sys.stdin.readline().strip()

def mint():
	return int(minp())

def mints():
	return map(int, minp().split())

def gcd(a, b):
	if b == 0:
		return (1, 0)
	(x, y) = gcd(b, a % b)
	return (y, x - y * (a // b))

def solve():
	n = mint()
	a = list(mints())
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	(x, y) = gcd(n, n - 1)
	print(1, n)
	print(' '.join([str(-i * x * n) for i in a]))
	print(1, n - 1)
	print(' '.join([str(-i * y * (n - 1)) for i in a[:n - 1]]))
	print(n, n)
	print(str(a[n - 1] * (x * n - 1)))
solve()


import sys
I = lambda : list(map(int, input().split()))
(n,) = I()
l = I()
if n == 1:
	print(1, 1)
	print(1)
	print(1, 1)
	print(1)
	print(1, 1)
	print(-l[0] - 2)
	sys.exit()
b = n - 1
a = [n * (b - l[i] % b) for i in range(n)]
print(1, n)
print(*a)
b = [-l[i] - a[i] for i in range(n)]
print(1, 1)
print(b[0])
print(2, n)
print(*b[1:])


def mulLen():
	n = int(input())
	a = list(map(int, input().split()))
	print(1, 1)
	print(-a[0])
	a[0] = 0
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	else:
		print(2, n)
		for i in a[1:]:
			print(i * (n - 1), end=' ')
		print()
		print(1, n)
		for i in a:
			print(-n * i, end=' ')
mulLen()


n = int(input())
l = list(map(int, input().split()))
if n > 3:
	print(1, n - 1)
	print(*[abs(l[i]) % n * (n - 1) * (-1 if l[i] < 0 else 1) if l[i] != 0 else 0 for i in range(n - 1)])
	print(1, n)
	print(*[-(abs(l[i]) % n * (n - 1) * (-1 if l[i] < 0 else 1) + l[i]) if l[i] != 0 and i != n - 1 else 0 for i in range(n)])
	print(n, n)
	print(-l[-1])
else:
	for i in range(n):
		print(i + 1, i + 1)
		print(-l[i])
	i = n
	while i < 3:
		print(1, 1)
		print(0)
		i += 1


n = int(input())
liczby = list(map(int, input().split()))
print(1, 1)
print(-1 * liczby[0])
print(min(2, n), n)
wynik = [(n - 1) * x for x in liczby[1:]]
if wynik != []:
	print(*wynik)
else:
	print(0)
print(1, n)
print(0, *[-1 * ((n - 1) * x + x) for x in liczby[1:]])


n = int(input())
a = [int(i) for i in input().split(' ')]
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])
else:
	print(1, n - 1)
	for i in range(n - 1):
		m = a[i] % n
		a[i] += (n - 1) * m
		print((n - 1) * m, end=' ')
	print()
	print(2, n)
	for i in range(1, n):
		m = a[i] % n
		a[i] += (n - 1) * m
		print((n - 1) * m, end=' ')
	print()
	print(1, n)
	for i in a:
		print(i * -1, end=' ')


def egcd(a, b):
	(x, y, u, v) = (0, 1, 1, 0)
	while a != 0:
		(q, r) = (b // a, b % a)
		(m, n) = (x - q * u, y - q * v)
		(b, a, x, y, u, v) = (a, r, u, v, m, n)
	gcd = b
	return (gcd, x, y)

def solve(a, b, c):
	(d, x0, y0) = egcd(abs(a), abs(b))
	if c % d != 0:
		return (False, 10 ** 19, 10 ** 19)
	x = x0 * (c // d)
	y = y0 * (c // d)
	if a < 0:
		x = -x
	if b < 0:
		y = -y
	return (True, x, y)
n = int(input())
a = list(map(int, input().split()))
(x, y) = ([0] * n, [0] * n)
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])
	exit(0)
for i in range(n):
	(_, x[i], y[i]) = solve(n, n - 1, -a[i])
print(1, n)
for i in range(n):
	print(n * x[i], end=' ' if i < n - 1 else '\n')
	a[i] += n * x[i]
print(1, 1)
print(-a[0])
print(2, n)
for i in range(1, n):
	print((n - 1) * y[i], end=' ' if i < n - 1 else '\n')


import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
print('1 1')
print(a[0] * (n - 1))
if n == 1:
	print('1 1')
	print('0')
else:
	print('2 ' + str(n))
	for i in range(1, n):
		print(a[i] * (n - 1), end=' ')
	print()
print('1 ' + str(n))
for i in range(n):
	print(-a[i] * n, end=' ')
print()


import sys, math
import io, os
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter

def data():
	return sys.stdin.readline().strip()

def mdata():
	return list(map(int, data().split()))

def outl(var):
	sys.stdout.write(' '.join(map(str, var)) + '\n')

def out(var):
	sys.stdout.write(str(var) + '\n')
from decimal import Decimal
mod = int(1000000000.0) + 7
INF = 10 ** 9
n = int(data())
a = mdata()
if n == 1:
	print(1, 1)
	out(-a[0])
	print(1, 1)
	out(0)
	print(1, 1)
	out(0)
	exit()
print(1, n - 1)
ans = []
for i in range(n - 1):
	ans.append((n - 1) * a[i])
	a[i] += (n - 1) * a[i]
outl(ans)
print(n, n)
out(-a[-1])
print(1, n)
a[-1] = 0
ans = []
for i in range(n):
	ans.append(-a[i])
outl(ans)


n = int(input())
l = list(map(int, input().split()))
print(1, 1)
print(-l[0])
l[0] = 0
print(min(n, 2), n)
lol = 0
for i in range(1, n):
	print(l[i] % n * (n - 1), end=' ')
	l[i] = l[i] + l[i] % n * (n - 1)
	lol = 1
if lol == 1:
	print()
else:
	print(0)
print(1, n)
for i in range(n):
	print(-l[i], end=' ')


n = int(input())
a = list(map(int, input().split()))
b = [i for i in a]
print(1, n)
for i in range(n):
	print(-1 * n * a[i], end=' ')
	b[i] -= n * a[i]
print()
print(1, max(n - 1, 1))
for i in range(max(n - 1, 1)):
	print(-1 * b[i], end=' ')
	b[i] += (n - 1) * a[i]
print()
print(n, n)
print(-1 * b[-1])


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print('1 1')
	print('0')
	print('1 1')
	print('0')
	print('1 1')
	print(-a[0])
else:
	print('1 1')
	print(-a[0])
	a[0] = 0
	print(2, n)
	tmp = n - 1
	for i in range(1, n):
		v = a[i] % n * tmp
		a[i] += v
		print(v, end=' ')
	print('')
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')


def solve(arr):
	n = len(arr)
	print(1, 1)
	print(-arr[0])
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	print(2, n)
	u = [(n - 1) * arr[i] for i in range(1, n)]
	print(*u)
	print(1, n)
	u = [0] + [-n * arr[i] for i in range(1, n)]
	print(*u)
	return
n = int(input())
arr = list(map(int, input().split()))
solve(arr)


import sys
import bisect
import math as mt
input = sys.stdin.readline
t = 1
mod = 10 ** 9 + 7
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	if n > 1:
		print(2, n)
		for i in range(1, n):
			print((n - 1) * l[i], end=' ')
		print()
		print(1, n)
		for i in range(n):
			print(-1 * n * l[i], end=' ')
		print()
		print(1, 1)
		print((n - 1) * l[0])
	else:
		print(1, 1)
		print(l[0])
		print(1, 1)
		print(l[0])
		print(1, 1)
		print(-3 * l[0])


import io
import os
from collections import Counter, defaultdict, deque

def solve(N, A):
	ans = ['1 1', str(-A[0])]
	A[0] = 0
	if N == 1:
		ans.append('1 1')
		ans.append('0')
		ans.append('1 1')
		ans.append('0')
		return '\n'.join(ans)
	assert N >= 2
	ans.append('1 ' + str(N))
	line = []
	for i in range(N):
		a = A[i]
		line.append(-a * N)
		A[i] += -a * N
	ans.append(' '.join(map(str, line)))
	ans.append('2 ' + str(N))
	line = []
	for i in range(1, N):
		a = A[i]
		assert a % (N - 1) == 0
		line.append(-a)
		A[i] -= a
	ans.append(' '.join(map(str, line)))
	return '\n'.join(ans)
DEBUG = False
if DEBUG:
	solve(1, [6])
	import random
	random.seed(0)
	for _ in range(100):
		N = random.randint(1, 10)
		A = [random.randint(1, 10) for i in range(N)]
		print('tc', _, N, A)
		ans1 = solve(N, A)
		print(ans1)
	exit()
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
(N,) = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
ans = solve(N, A)
print(ans)


n = int(input())
a = list(map(int, input().split()))
if n <= 3:
	for i in range(n):
		print(i + 1, i + 1)
		print(-a[i])
	for i in range(3 - n):
		print(1, n)
		print('0 ' * n)
else:
	k = n - 1
	d = [0 for i in range(n)]
	for i in range(1, n + 20):
		d[i * k % n] = i * k
	print(1, n - 1)
	for i in range(n - 1):
		q = a[i] % n
		print(-d[q], end=' ')
		a[i] -= d[q]
	print()
	print(2, n)
	for i in range(1, n):
		q = a[i] % n
		print(-d[q], end=' ')
		a[i] -= d[q]
	print()
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')


def diof(a, b, right):
	(a1, b1, right1) = (a, b, right)
	d = 0
	m = 0
	if a < b:
		(a, b) = (b, a)
		m = 1
	if b == 0:
		d = a
		x = 1
		y = 0
	else:
		x2 = 1
		x1 = 0
		y2 = 0
		y1 = 1
		while b > 0:
			r = a % b
			q = (a - r) // b
			x = x2 - q * x1
			y = y2 - q * y1
			a = b
			b = r
			x2 = x1
			x1 = x
			y2 = y1
			y1 = y
		d = a
		x = x2
		y = y2
	if m == 1:
		(x, y) = (y, x)
	if right % d != 0:
		print('Impossible')
	else:
		k = right // d
		x = x * k
		y = y * k
		n = x * d // b1
		x = x - n * b1 // d
		y = y + n * a1 // d
		return (x, y)
n = int(input())
mas = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-mas[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-mas[0])
	mas[0] = 0
	print(2, n)
	for i in range(1, n):
		(x, y) = diof(n, n - 1, -mas[i])
		mas[i] += y * (n - 1)
		print(y * (n - 1), end=' ')
	print()
	print(1, n)
	for i in range(n):
		print(-mas[i], end=' ')


n = int(input())
a = [int(x) for x in input().split()]
if n > 1:
	print('1 1')
	print(-a[0])
	print('2 ' + str(n))
	for i in range(1, n):
		print((n - 1) * a[i], end=' ')
	print('')
	print('1 ' + str(n))
	print('0', end=' ')
	for i in range(1, n):
		print(-(a[i] + (n - 1) * a[i]), end=' ')
else:
	print('1 1')
	print(-a[0])
	print('1 1')
	print(0)
	print('1 1')
	print(0)


n = int(input())
a = list(map(int, input().split()))
if n >= 2:
	m1 = n - 1
	m2 = n
	b1 = ((2, len(a)), [m1 * a_i for a_i in a[1:]])
	b2 = ((1, len(a)), [-m2 * a_i for a_i in a])
	b3 = ((1, 1), [-(a[0] + b2[1][0])])
	for ((l, r), b) in [b1, b2, b3]:
		print(l, r)
		print(*b)
else:
	for _ in range(2):
		print(1, 1)
		print(0)
	print(1, 1)
	print(-a[0])


from typing import List

def multiplesOfLength(N: int, inputs: List[int]) -> None:
	print(1, N)
	for i in range(N):
		print(-N * inputs[i], end=' ')
	print()
	if N > 1:
		print(1, N - 1)
		for i in range(N - 1):
			print((N - 1) * inputs[i], end=' ')
		print()
		print(N, N)
		print(-(-N * inputs[-1] + inputs[-1]))
	else:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	return
N = int(input())
inputs = list(map(int, input().split(' ')))
multiplesOfLength(N, inputs)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def RL():
	return map(int, sys.stdin.readline().rstrip().split())

def RLL():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def N():
	return int(input())

def print_list(l):
	print(' '.join(map(str, l)))
n = N()
a = RLL()
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])
else:
	print(1, n)
	t1 = []
	for i in range(n):
		t1.append(n * (n - a[i] - 1))
	print_list(t1)
	print(1, n - 1)
	print_list([-(a[i] + t1[i]) for i in range(n - 1)])
	print(n, n)
	print(-(a[-1] + t1[-1]))


n = int(input())
arr = list(map(int, input().split()))
if n == 1:
	print('1 1')
	print(-arr[0])
	print('1 1')
	print('0')
	print('1 1')
	print('0')
else:
	print('1 ' + str(n - 1))
	for i in range(len(arr) - 1):
		print(arr[i] % n * (n - 1), end=' ')
		arr[i] += arr[i] % n * (n - 1)
	print()
	print(str(n) + ' ' + str(n))
	print(n - arr[-1] % n)
	arr[-1] += n - arr[-1] % n
	print('1 ' + str(n))
	for i in range(len(arr)):
		print(-arr[i], end=' ')
	print()


n = int(input())
nums = [int(x) for x in input().split()]
if n == 1:
	print(1, 1)
	print(-nums[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
elif n == 2:
	print(1, 1)
	print(-nums[0])
	print(2, 2)
	print(-nums[1])
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-nums[0])
	print(2, n)
	print(' '.join((str((n - 1) * (nums[i] % n)) for i in range(1, n))))
	for i in range(1, n):
		nums[i] += (n - 1) * (nums[i] % n)
	nums[0] = 0
	print(1, n)
	print(' '.join((str(-nums[i]) for i in range(n))))


def modInverse(a, m):
	m0 = m
	y = 0
	x = 1
	if m == 1:
		return 0
	while a > 1:
		q = a // m
		t = m
		m = a % m
		a = t
		t = y
		y = x - q * y
		x = t
	if x < 0:
		x = x + m0
	return x
n = int(input())
(*arr,) = map(int, input().split())
if n == 1:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	inv = modInverse(n - 1, n)
	inverses = [(n - v) % n * inv % n for v in arr]
	print(2, n)
	line = []
	for i in range(1, n):
		v = (n - 1) * inverses[i]
		line.append(v)
		arr[i] += v
	print(' '.join(map(str, line)))
	print(1, n)
	line = [0]
	for i in range(1, n):
		line.append(-arr[i])
		arr[i] = 0
	print(' '.join(map(str, line)))
	print(1, 1)
	print(-arr[0])


from sys import stdin, stdout

def multiples_of_length(n, a_a):
	if n == 1:
		return [[1, 1], [1], [1, 1], [1], [1, 1], [-a_a[0] - 2]]
	ans_a = [[] for _ in range(6)]
	ans_a[0].append(1)
	ans_a[0].append(n)
	ans_a[2].append(1)
	ans_a[2].append(n - 1)
	ans_a[4].append(n)
	ans_a[4].append(n)
	for i in range(n):
		ans_a[1].append(-a_a[i] * n)
		if i < n - 1:
			ans_a[3].append(a_a[i] * (n - 1))
		elif i == n - 1:
			ans_a[5].append(-a_a[i] * (1 - n))
	return ans_a
n = int(stdin.readline())
a_a = list(map(int, stdin.readline().split()))
ans_a = multiples_of_length(n, a_a)
for ans in ans_a:
	stdout.write(' '.join(map(str, ans)) + '\n')


from os import path
import sys
from heapq import heappush, heappop
from functools import cmp_to_key as ctk
from collections import deque, defaultdict as dd
from bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right
from itertools import permutations
from datetime import datetime
from math import ceil, sqrt, log, gcd

def ii():
	return int(input())

def si():
	return input().rstrip()

def mi():
	return map(int, input().split())

def li():
	return list(mi())
abc = 'abcdefghijklmnopqrstuvwxyz'
mod = 1000000007
inf = float('inf')
vow = ['a', 'e', 'i', 'o', 'u']
(dx, dy) = ([-1, 1, 0, 0], [0, 0, 1, -1])

def bo(i):
	return ord(i) - ord('a')
file = 1

def solve():
	n = ii()
	a = li()
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		print(1, 1)
		print(-a[0])
		return
	print(1, 1)
	print(a[0] * n - a[0])
	print(2, n)
	for i in range(1, n):
		print(a[i] * (n - 1), end=' ')
	print()
	print(1, n)
	for i in range(n):
		print(-a[i] * n, end=' ')
if file:
	if path.exists('input.txt'):
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	else:
		input = sys.stdin.readline
solve()


import sys, os.path
if os.path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	for i in range(3):
		if i != 2:
			print('1 1')
			print(0)
		else:
			print('1 1')
			print(-a[0])
else:
	ans = []
	final = []
	for i in range(0, n):
		if i == 0:
			ans.append(0)
		else:
			ans.append(-a[i] * n)
			a[i] -= n * a[i]
		if i != 0:
			final.append(-a[i])
	for i in range(3):
		if i == 0:
			print('1 1')
			print(-a[0])
		elif i == 1:
			print(f'1 {n}')
			print(*ans)
		else:
			print(f'2 {n}')
			print(*final)


def main():
	n = int(input())
	T = list(map(int, input().split(' ')))
	if n == 1:
		print('1 1\n%d\n1 1\n0\n1 1\n0\n' % -T[0])
		return
	else:
		print('2 %d' % n)
		c = []
		for i in range(1, n):
			a = T[i] % n * (n - 1)
			T[i] += a
			c.append(a)
		print(' '.join(['%d' % x for x in c]))
		print('1 1')
		print(-T[0])
		T[0] -= T[0]
		print('1 %d' % n)
		print(' '.join(['%d' % -x for x in T]))
main()


def fun(ai, n):
	ii = -ai % n
	num = ii * n - ii - ai
	return num
n = int(input())
a = [int(i) for i in input().split()]
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	ans1 = []
	for i in range(n):
		if a[i] % n == 0:
			ans1.append(-a[i])
			a[i] = 0
		else:
			ans1.append(fun(a[i], n))
			a[i] += ans1[-1]
	ans2 = []
	for i in range(n - 1):
		ans2.append(-a[i])
	print(1, n)
	print(*ans1)
	print(1, n - 1)
	print(*ans2)
	print(n, n)
	print(-a[-1])


import sys
sys.setrecursionlimit(10 ** 5)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep='\n')

def II():
	return int(sys.stdin.readline())

def MI():
	return map(int, sys.stdin.readline().split())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI(rows_number):
	return [LI() for _ in range(rows_number)]

def SI():
	return sys.stdin.readline()[:-1]

def solve():
	if n == 1:
		print(1, 1)
		print(-aa[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		exit()
	print(1, n)
	bb = [-a * n for a in aa[:-1]] + [0]
	print(*bb)
	print(1, n - 1)
	bb = [a * (n - 1) for a in aa[:-1]]
	print(*bb)
	print(n, n)
	print(-aa[-1])
n = II()
aa = LI()
solve()


n = int(input())
a = [int(x) for x in input().split()]
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit(0)
print(1, 1)
print(-a[0])
a[0] = 0
print(2, n)
for i in range(1, n):
	print(a[i] * (n - 1), end=' ')
print()
print(1, n)
for i in range(n):
	print(-a[i] * n, end=' ')
print()


import sys
import math
import itertools
import functools
import collections
import operator
import fileinput
import copy
ORDA = 97

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return [int(i) for i in input().split()]

def lcm(a, b):
	return abs(a * b) // math.gcd(a, b)

def revn(n):
	return str(n)[::-1]

def dd():
	return collections.defaultdict(int)

def ddl():
	return collections.defaultdict(list)

def sieve(n):
	if n < 2:
		return list()
	prime = [True for _ in range(n + 1)]
	p = 3
	while p * p <= n:
		if prime[p]:
			for i in range(p * 2, n + 1, p):
				prime[i] = False
		p += 2
	r = [2]
	for p in range(3, n + 1, 2):
		if prime[p]:
			r.append(p)
	return r

def divs(n, start=2):
	r = []
	for i in range(start, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n / i == i:
				r.append(i)
			else:
				r.extend([i, n // i])
	return r

def divn(n, primes):
	divs_number = 1
	for i in primes:
		if n == 1:
			return divs_number
		t = 1
		while n % i == 0:
			t += 1
			n //= i
		divs_number *= t

def prime(n):
	if n == 2:
		return True
	if n % 2 == 0 or n <= 1:
		return False
	sqr = int(math.sqrt(n)) + 1
	for d in range(3, sqr, 2):
		if n % d == 0:
			return False
	return True

def convn(number, base):
	new_number = 0
	while number > 0:
		new_number += number % base
		number //= base
	return new_number

def cdiv(n, k):
	return n // k + (n % k != 0)

def ispal(s):
	for i in range(len(s) // 2 + 1):
		if s[i] != s[-i - 1]:
			return False
	return True
n = ii()
a = li()
first = []
for i in range(n):
	first.append(-n * a[i])
second = []
for i in range(n - 1):
	second.append(a[i] * (n - 1))
if n != 1:
	print(1, n)
	print(*first)
	print(1, n - 1)
	print(*second)
	print(n, n)
	print(a[n - 1] * (n - 1))
else:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


from collections import *
from sys import stdin, stderr

def rl():
	return [int(w) for w in stdin.readline().split()]
(n,) = rl()
a = rl()
if n > 1:
	print(1, n)
	print(*(-n * x for x in a))
	print(1, n - 1)
	print(*((n - 1) * x for x in a[:-1]))
	print(n, n)
	print((n - 1) * a[-1])
else:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


n = int(input())
a = list(map(int, input().split()))
l = a[-1]
if n > 1:
	print(1, n - 1)
	print(*[(n - 1) * i for i in a[:n - 1]])
else:
	print(1, 1)
	print(0)
print(n, n)
print(-l)
print(1, n)
print(*[-n * i for i in a[:-1]] + [0])


import sys
input = sys.stdin.buffer.readline
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])
else:
	print(1, 1)
	print(-a[0])
	print(2, n)
	b = [0] * (n - 1)
	for i in range(1, n):
		b[i - 1] = a[i] * (n - 1)
	print(*b)
	print(1, n)
	b = [0] * n
	for i in range(1, n):
		b[i] = -a[i] * n
	print(*b)


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(f'1 1')
	print(f'{-a[0]}')
	print(f'1 1')
	print('0')
	print(f'1 1')
	print('0')
	exit()
if n == 2:
	print(f'1 1')
	print(f'{-a[0]}')
	print(f'2 2')
	print(f'{-a[1]}')
	print(f'1 1')
	print('0')
	exit()
print(f'1 {n}')
x = [(n - 1 - a[i] % (n - 1)) * n for i in range(n)]
print(' '.join(map(str, x)))
print(f'1 1')
print(f'{-a[0] - x[0]}')
print(f'2 {n}')
print(' '.join(map(str, [-(a[i] + x[i]) for i in range(1, n)])))


import sys

def i():
	return sys.stdin.readline()[:-1]
n = int(i())
nums = list(map(int, i().split()))
if n == 1:
	print('1 1')
	print('0')
	print('1 1')
	print('0')
	print('1 1')
	print(-nums[0])
else:
	print(1, n - 1)
	for x in range(len(nums) - 1):
		print((n - 1) * (nums[x] % n), end=' ')
	print()
	print(n, n)
	print(-nums[n - 1])
	print(1, n)
	for x in range(len(nums) - 1):
		print(-(nums[x] + (n - 1) * (nums[x] % n)), end=' ')
	print('0')


n = int(input())
ls = list(map(int, input().split()))
if n > 1:
	print(1, n)
	res = []
	res_2 = []
	for (idx, item) in enumerate(ls):
		remain = n - 1 - item % (n - 1)
		res.append(str(remain * n))
		ls[idx] += remain * n
		res_2.append(str(-ls[idx]))
	print(' '.join(res))
	print(1, 1)
	print(-ls[0])
	print(2, n)
	print(' '.join(res_2[1:]))
else:
	print(1, 1)
	print(-ls[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


import sys
mod = 1000000007
input = lambda : sys.stdin.readline().rstrip('\r\n')
n = int(input())
a = list(map(int, input().split()))
if len(a) > 1:
	print(1, 1)
	print(-a[0])
	a[0] = 0
	print(2, n)
	for i in range(1, n):
		t = (n - 1) * a[i]
		a[i] += t
		print(t, end=' ')
	print()
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')
	print()
else:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


import io, os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(n, n)
	print(0)
	print(n, n)
	print(0)
	print(n, n)
	print(-l[-1])
elif n == 2:
	print(n - 1, n - 1)
	print(-l[-2])
	print(n, n)
	print(-l[-1])
	print(n, n)
	print(0)
else:
	res = []
	for ii in range(n - 1):
		i = l[ii]
		if i > 0:
			res.append([-n * i, +(n - 1) * i])
		elif i < 0:
			res.append([+n * -i, -(n - 1) * -i])
		else:
			res.append([0, 0])
	print(1, n)
	for i in res:
		print(i[0], end=' ')
	print(0)
	print(1, n - 1)
	for i in res:
		print(i[1], end=' ')
	print()
	print(n, n)
	print(-l[-1])


n = int(input())
A = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-A[0])
else:
	X = []
	for i in range(1, n):
		c = A[i] * (n - 1)
		X.append(c)
		A[i] += c
	Y = [0]
	for i in range(1, n):
		Y.append(A[i] * -1)
	print(2, n)
	print(*X)
	print(1, n)
	print(*Y)
	print(1, 1)
	print(-A[0])


import math
N = int(input())
A = list(map(int, input().split()))
if N > 1:
	print(1, N)
	for i in range(N):
		a = A[i]
		add = -N * (a % (N - 1))
		A[i] += add
		print(add, end=' ')
	print('')
	print(1, N - 1)
	for a in A[:N - 1]:
		print(-a, end=' ')
	print('')
	print(N, N)
	print(-A[-1])
else:
	print(1, 1)
	print(-A[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	op1 = (1, n - 1)
	op2 = (n, n)
	op3 = (1, n)
	ops1 = []
	for i in range(n - 1):
		ops1.append((n - 1) * (a[i] % n))
		a[i] += (n - 1) * (a[i] % n)
	ops2 = []
	if a[-1] < 0:
		ops2.append((n - a[-1]) % n)
		a[-1] += (n - a[-1]) % n
	else:
		ops2.append(-(a[-1] % n))
		a[-1] -= a[-1] % n
	ops3 = []
	for i in range(n):
		ops3.append(-a[i])
	print(*op1)
	print(*ops1)
	print(*op2)
	print(*ops2)
	print(*op3)
	print(*ops3)


N = int(input())
A = list(map(int, input().split()))
if N == 1:
	import sys
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-A[0])
	sys.exit(0)
to_add = []
for i in range(N - 1):
	to_add += [A[i] * (N - 1)]
print(1, N - 1)
print(*to_add)
for i in range(N - 1):
	A[i] += to_add[i]
to_add = N - A[-1]
if to_add == 0:
	to_add = N
print(N, N)
print(to_add)
A[-1] += to_add
to_add = []
for a in A:
	assert a % N == 0
	to_add += [-a]
print(1, N)
print(*to_add)


n = int(input())
arr = [int(i) for i in input().split()]
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-arr[0])
else:
	print(1, 1)
	print(-arr[0])
	arr[0] = 0
	print(1, n)
	for i in range(n):
		print(-(n * arr[i]), end=' ')
	print()
	print(2, n)
	for i in range(1, n):
		print((n - 1) * arr[i], end=' ')
	print()


from collections import Counter
from typing import *
(n, a) = (int(input()), [int(x) for x in input().split()])
if n == 1:
	print('1 1\n0')
	print('1 1\n0')
	print('1 1\n{}'.format(-a[0]))
else:
	print('1 {}'.format(n - 1))
	for i in range(n - 1):
		print(a[i] * (n - 1), end=' ')
		a[i] *= n
	print('')
	print('{} {}\n{}'.format(n, n, a[n - 1] * (n - 1)))
	a[n - 1] *= n
	print('1 {}'.format(n))
	for i in range(n):
		print(-a[i], end=' ')


n = int(input())
a = list(map(int, input().split()))
if n != 1:
	print('1 1')
	print(str((n - 1) * a[0]))
	print('2 ' + str(n))
	print(' '.join(map(lambda x: str((n - 1) * x), a[1:])))
	print('1 ' + str(n))
	print(' '.join(map(lambda x: str(-n * x), a)))
else:
	print('1 1')
	print(0)
	print('1 1')
	print(0)
	print('1 1')
	print(-a[0])


import sys
import math
from collections import defaultdict, Counter
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0 - a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n - 1)
	for i in range(n - 1):
		print(a[i] * (n - 1), end=' ')
		a[i] += a[i] * (n - 1)
	print()
	print(n, n)
	print(0 - a[-1])
	a[-1] = 0
	print(1, n)
	for i in range(n):
		print(0 - a[i], end=' ')


import sys
n = int(sys.stdin.readline().strip())
a = list(map(int, sys.stdin.readline().strip().split()))
if n > 1:
	print(1, n)
	print(' '.join(list(map(str, [-a[i] * n for i in range(0, n)]))))
	print(2, n)
	print(' '.join(list(map(str, [a[i] * (n - 1) for i in range(1, n)]))))
	print(1, 1)
	print(a[0] * (n - 1))
else:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])


import sys, math, heapq, copy
from collections import defaultdict, deque
from bisect import bisect_left, bisect_right
from functools import cmp_to_key
n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print('1 1\n0')
	print('1 1\n0')
	print(f'1 1\n{-l[0]}')
else:
	print(f'1 1\n{-l[0]}')
	print(f'2 {n}')
	l[0] = 0
	for i in range(1, n):
		val = l[i] % n * (n - 1)
		print(val, end=' ')
		l[i] += val
	print()
	print(f'1 {n}')
	for i in range(n):
		print(-l[i], end=' ')


n = int(input())
if n == 1:
	print(1, 1)
	print(-int(input()))
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
arr = list(map(int, input().split()))
print(1, 1)
print(-arr[0])
arr[0] = 0
print(1, n)
print(*[-e * n for e in arr])
print(2, n)
print(*[e * (n - 1) for e in arr[1:]])


N = int(input())
a_vec = input().split(' ')
a_vec = [int(a) for a in a_vec]
if N == 1:
	print(f'1 1\n0\n1 1\n0\n1 1\n{-a_vec[0]}')
else:
	print(f'1 {N}')
	s_vec = ['' for _ in range(N)]
	for n in range(0, N - 1):
		s_vec[n] = str(-a_vec[n] * N)
	s_vec[N - 1] = '0'
	print(' '.join(s_vec))
	print(f'1 {N - 1}')
	s_vec = ['' for _ in range(N - 1)]
	for n in range(0, N - 1):
		s_vec[n] = str(a_vec[n] * (N - 1))
	print(' '.join(s_vec))
	print(f'{N} {N}\n{-a_vec[N - 1]}')


def scanInt():
	return int(input())

def scanList():
	return [i for i in input().split(' ')]

def scanIntList():
	return [int(i) for i in scanList()]
n = scanInt()
a = scanIntList()
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit(0)
print(1, n)
for i in range(n):
	print(-a[i] * n, end=' ')
	a[i] -= a[i] * n
print()
print(1, n - 1)
for i in range(n - 1):
	print(-a[i], end=' ')
print()
print(n, n)
print(-a[n - 1])


import sys
import math, bisect
sys.setrecursionlimit(10 ** 5)
from collections import defaultdict
from itertools import groupby, accumulate
from heapq import heapify, heappop, heappush
from collections import deque, Counter, OrderedDict

def I():
	return int(sys.stdin.readline())

def neo():
	return map(int, sys.stdin.readline().split())

def Neo():
	return list(map(int, sys.stdin.readline().split()))
n = I()
l = Neo()
if n == 1:
	s = '1 1\n' + str(-l[0]) + '\n1 1\n0\n1 1\n0'
	print(s)
else:
	(a, an) = ([], [])
	for i in range(n):
		an.append(-l[i] * n)
	b = -(l[0] + an[0])
	for i in range(1, n):
		a.append(l[i] * (n - 1))
	print(1, n)
	print(*an)
	print(1, 1)
	print(b)
	print(2, n)
	print(*a)


from sys import stdin, stdout
import math
from itertools import permutations, combinations
from collections import defaultdict
from bisect import bisect_left
from bisect import bisect_right

def L():
	return list(map(int, stdin.readline().split()))

def In():
	return map(int, stdin.readline().split())

def I():
	return int(stdin.readline())
P = 1000000007

def main():
	n = I()
	arr = L()
	print(1, 1)
	print(-arr[0])
	arr[0] = 0
	if n > 1:
		print(2, n)
		for i in range(1, n):
			print(arr[i] % n * (n - 1), end=' ')
			arr[i] += arr[i] % n * (n - 1)
			arr[i] *= -1
		print()
		print(1, n)
		print(*arr)
	else:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
main()


n = int(input())
A = list(map(int, input().split()))
print('1 1\n' + str(A[0] * (n - 1)))
if n < 2:
	print('1 1\n0')
else:
	print(2, n)
	print(*[(n - 1) * A[i] for i in range(1, n)])
print(1, n)
print(*[-n * A[i] for i in range(n)])


import sys
input = sys.stdin.readline

def solution():
	N = int(input())
	A = list(map(int, input().split()))
	if N == 1:
		print(1, 1)
		print(-A[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	print(1, N - 1)
	for i in range(N - 1):
		print((N - 1) * A[i], end=' ')
		A[i] += (N - 1) * A[i]
	print()
	print(N, N)
	print(-A[-1])
	A[-1] = 0
	print(1, N)
	for i in range(N):
		print(-A[i], end=' ')
	print()
solution()


n = int(input())
arr = list(map(int, input().split()))
if n > 1:
	l1 = []
	for i in range(n - 1):
		l1.append(arr[i] % n * (n - 1))
	print(1, n - 1)
	print(*l1)
	print(n, n)
	print(-(arr[-1] % n))
	print(1, n)
	l2 = []
	for i in range(n):
		if i < n - 1:
			val = arr[i] + l1[i]
		else:
			val = arr[i] - arr[-1] % n
		l2.append(val * -1)
	print(*l2)
else:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


n = int(input(''))
arr = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-arr[0])
	print(2, n)
	sol = []
	for i in range(1, n):
		sol.append((n - 1) * arr[i])
	print(*sol)
	sol = [0]
	print(1, n)
	for i in range(1, n):
		sol.append(-n * arr[i])
	print(*sol)


n = int(input())
l = list(map(int, input().split()))
a = []
b = []
c = []
if n >= 3:
	print(1, n - 1)
	for i in range(0, n - 1):
		a.append((n - 1) * l[i])
	for i in a:
		print(i, end=' ')
	print()
	print(2, n)
	b = [0] * (n - 2)
	b.append(l[-1] * (n - 1))
	for i in b:
		print(i, end=' ')
	print()
	print(1, n)
	for i in range(0, n):
		c.append(l[i] * n * -1)
	for i in c:
		print(i, end=' ')
	print()
elif n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(l[0] * -1)
elif n == 2:
	print(1, 1)
	print(-1 * l[0])
	print(2, 2)
	print(-1 * l[1])
	print(1, 1)
	print(0)


n = int(input())
b = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-b[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	a1 = [0]
	j = 1
	while j < n:
		a1.append(-b[j] * n)
		j += 1
	a2 = [-b[0]]
	a3 = []
	j = 1
	while j < n:
		a3.append(b[j] * (n - 1))
		j += 1
	print(1, n)
	print(*a1)
	print(1, 1)
	print(*a2)
	print(2, n)
	print(*a3)


import sys
import bisect as bi
import math
from collections import defaultdict as dd
import heapq
import itertools
input = sys.stdin.readline
from random import randint
mo = 10 ** 9 + 7

def cin():
	return map(int, sin().split())

def ain():
	return list(map(int, sin().split()))

def sin():
	return input()

def inin():
	return int(input())
for _ in range(1):
	n = inin()
	a = ain()
	if n == 1:
		print(1, 1)
		print(-a[-1])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	else:
		print(1, n - 1)
		for i in range(n - 1):
			k = a[i] * (n - 1)
			a[i] = a[i] + k
			print(k, end=' ')
		print()
		print(n, n)
		j = -a[-1]
		a[-1] = a[-1] + j
		print(j)
		print(1, n)
		for i in range(n):
			print(0 - a[i], end=' ')
		print()


import sys
n = int(input())
a = [int(o) for o in input().split()]
numbers = [[] for i in range(n)]
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	for i in range(n):
		numbers[i] = [-1 * n * a[i], (n - 1) * a[i]]
	print(1, n)
	for i in range(n):
		print(numbers[i][0], end=' ')
	print()
	print(1, n - 1)
	for i in range(n - 1):
		print(numbers[i][1], end=' ')
	print()
	print(2, n)
	for i in range(1, n - 1):
		print(0, end=' ')
	print(numbers[-1][1])


n = int(input())
s = list(map(int, input().split()))
if n > 1:
	print(n, n)
	print(n - s[-1] % n)
	s[-1] += n - s[-1] % n
	print(1, n - 1)
	for i in range(n - 1):
		f = s[i] * (n - 1)
		print(f, end=' ')
		s[i] += f
	print()
	print(1, n)
	print(*[-i for i in s])
else:
	print(1, 1)
	print(-s[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])
	sys.exit(0)
m = n - 1
o1 = []
for i in range(m):
	o1.append(a[i] * m)
	a[i] = a[i] * m + a[i]
print(1, m)
print(*o1)
print(n, n)
print(n - a[-1])
a[-1] = n
print(1, n)
a = [-i for i in a]
print(*a)


from collections import Counter
import string
import math
import sys
from fractions import Fraction

def array_int():
	return [int(i) for i in sys.stdin.readline().split()]

def vary(arrber_of_variables):
	if arrber_of_variables == 1:
		return int(sys.stdin.readline())
	if arrber_of_variables >= 2:
		return map(int, sys.stdin.readline().split())

def makedict(var):
	return dict(Counter(var))
testcases = 1
for _ in range(testcases):
	n = vary(1)
	num = array_int()
	if n == 1:
		print(1, 1)
		print(-1 * num[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	else:
		print(1, 1)
		print(-1 * num[0])
		print(1, n)
		print(0, end=' ')
		for i in range(1, n):
			print(-1 * n * num[i], end=' ')
		print()
		print(2, n)
		for i in range(1, n):
			print((n - 1) * num[i], end=' ')
		print()


import os
from io import BytesIO
input = BytesIO(os.read(0, os.fstat(0).st_size)).readline

def lii():
	return list(map(int, input().split()))

def ii():
	return int(input())

def main():
	n = ii()
	A = lii()
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		print(1, 1)
		print(-A[0])
		return
	print(1, n)
	for i in range(n - 1):
		print(-n * A[i], end=' ')
	print(0)
	print(1, n - 1)
	for i in range(n - 1):
		print((n - 1) * A[i], end=' ')
	print()
	print(n, n)
	print(-A[-1])
main()


n = int(input())
l = input().split()
li = [int(i) for i in l]
if n == 1:
	print(1, 1)
	print(-li[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	quit()
print(1, n - 1)
for i in range(n - 1):
	z = li[i] % n
	print(z * (n - 1), end=' ')
	li[i] = li[i] + z * (n - 1)
print()
print(2, n)
for i in range(1, n):
	z = li[i] % n
	print(z * (n - 1), end=' ')
	li[i] = li[i] + z * (n - 1)
print()
print(1, n)
for i in range(n):
	print(-li[i], end=' ')
print()


n = int(input())
s = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-s[0])
	for _ in range(2):
		print(1, 1)
		print(0)
	exit()
print(1, n - 1)
ans = []
for x in s[:-1]:
	ans.append(x * (n - 1))
print(*ans)
print(1, n)
ans = []
for x in s:
	ans.append(-x * n)
print(*ans)
s[-1] -= x * n
print(n, n)
print(-s[-1])


import time, math as mt, bisect as bs, sys
from sys import stdin, stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict
pi = 3.141592653589793

def II():
	return int(stdin.readline())

def IO():
	return stdin.readline()

def IP():
	return map(int, stdin.readline().split())

def L():
	return list(map(int, stdin.readline().split()))

def P(x):
	return stdout.write(str(x) + '\n')

def PI(x, y):
	return stdout.write(str(x) + ' ' + str(y) + '\n')

def lcm(a, b):
	return a * b // gcd(a, b)

def gcd(a, b):
	if a == 0:
		return b
	elif b == 0:
		return a
	if a > b:
		return gcd(a % b, b)
	else:
		return gcd(a, b % a)

def readTree():
	v = int(input())
	adj = [set() for i in range(v + 1)]
	for i in range(v - 1):
		(u1, u2) = In()
		adj[u1].add(u2)
		adj[u2].add(u1)
	return (adj, v)

def bfs(adj, v):
	visited = [False] * (v + 1)
	q = deque()
	while q:
		pass

def sieve():
	li = [True] * 1000001
	(li[0], li[1]) = (False, False)
	for i in range(2, len(li), 1):
		if li[i] == True:
			for j in range(i * i, len(li), i):
				li[j] = False
	prime = []
	for i in range(1000001):
		if li[i] == True:
			prime.append(i)
	return prime

def setBit(n):
	count = 0
	while n != 0:
		n = n & n - 1
		count += 1
	return count
mx = 10 ** 7
spf = [mx] * (mx + 1)

def SPF():
	spf[1] = 1
	for i in range(2, mx + 1):
		if spf[i] == mx:
			spf[i] = i
			for j in range(i * i, mx + 1, i):
				if i < spf[j]:
					spf[j] = i
	return
mod = 10 ** 9 + 7

def solve():
	n = II()
	li = L()
	if n == 1:
		print(1, 1)
		print(-1 * li[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	print(1, n - 1)
	for i in range(n - 1):
		print(li[i] * (n - 1), end=' ')
		li[i] += li[i] * (n - 1)
	print()
	print(1, n)
	for i in range(n - 1):
		print(-1 * li[i], end=' ')
	print(n)
	li[-1] += n
	print(n, n)
	print(-1 * li[-1])
	return
t = 1
for i in range(t):
	solve()


from sys import stdin
input = lambda : stdin.readline().strip()
from math import ceil, sqrt, factorial, gcd
from collections import deque
n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-1 * l[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n - 1)
	z = []
	for i in range(n - 1):
		if l[i] % (n - 1) == 0:
			z.append(-1 * l[i])
		else:
			z.append((n - 1) * l[i])
		l[i] = z[-1] + l[i]
	print(*z)
	print(n, n)
	print(-1 * l[-1])
	l[-1] = 0
	z = []
	print(1, n)
	for i in range(n):
		z.append(-1 * l[i])
	print(*z)


from math import *
from bisect import *
from collections import Counter, defaultdict
from sys import stdin, stdout
input = stdin.readline
I = lambda : int(input())
SI = lambda : input()
M = lambda : map(int, input().split())
LI = lambda : list(map(int, input().split()))
n = I()
a = LI()
if n == 1:
	print('1 1', -a[0], '1 1', '0', '1 1', '0', sep='\n')
	exit(0)
print(1, n)
for i in range(n):
	print(-a[i] * n, end=' ')
	a[i] -= a[i] * n
print()
print(1, n - 1)
for i in range(n - 1):
	print(-a[i], end=' ')
	a[i] = 0
print()
print(2, n)
for i in range(1, n):
	print(-a[i], end=' ')
	a[i] = 0
print()


n = int(input())
a = [int(x) for x in input().split()]
print('1 1')
print(a[0] * -1)
a[0] = 0
if n > 1:
	print('2 ', n)
	for i in range(1, n):
		m = a[i] % n
		add = m * (n - 1)
		a[i] = a[i] + add
		print(add, end=' ')
	print('\n1 ', n)
	for i in range(n):
		print(-1 * a[i], end=' ')
	print('')
else:
	print('1 1\n0\n1 1\n0')


def solve(n, arr):
	print('1 1')
	print(-1 * arr[0])
	arr[0] = 0
	if n == 1:
		print('1 1')
		print('0')
		print('1 1')
		print('0')
	else:
		print('2 ' + str(n))
		b = [str(x * (n - 1)) for x in arr[1:]]
		string = ' '.join(b)
		print(string)
		print('1 ' + str(n))
		b = [str(-1 * n * x) for x in arr]
		string = ' '.join(b)
		print(string)

def main():
	n = int(input())
	arr = [int(x) for x in input().split()]
	assert n == len(arr)
	solve(n, arr)
main()


import sys
input = sys.stdin.readline
import heapq
import copy
import math
import decimal

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def insr2():
	s = input()
	return s[:len(s) - 1]

def invr():
	return map(int, input().split())
ans = 0

def pr_list(a):
	print(*a, sep=' ')

def main():
	tests = 1
	mod = 1000000007
	limit = 10 ** 18
	ans = 0
	stack = []
	hashm = {}
	arr = []
	heapq.heapify(arr)
	for test in range(tests):
		n = inp()
		a = inlt()
		if n != 1:
			l = 1
			r = n - 1
			nums = []
			for i in range(l, r + 1):
				if a[i] % n == 0:
					nums.append(0)
				else:
					nums.append((n - 1) * (a[i] % n))
					a[i] = a[i] + (n - 1) * (a[i] % n)
			pr_list([l + 1, r + 1])
			pr_list(nums)
		else:
			pr_list([1, 1])
			print(0)
		l = 0
		r = 0
		pr_list([1, 1])
		print(-1 * (a[0] % n))
		a[0] = a[0] - a[0] % n
		l = 0
		r = n - 1
		pr_list([l + 1, r + 1])
		nums = []
		for i in range(l, r + 1):
			nums.append(-1 * a[i])
		pr_list(nums)
main()


n = int(input())
a = [int(x) for x in input().split()]
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])
else:
	print(1, 1)
	print(-a[0])
	a[0] = 0
	print(2, n)
	print(*[x * (n - 1) for x in a[1:]])
	print(1, n)
	print(*[0] + [-x * n for x in a[1:]])


from collections import defaultdict as dd
from sys import stdin, stdout
n = int(input())
a = list(map(int, input().split()))
stdout.write('1 1\n')
stdout.write(str(-a[0]) + '\n')
if n == 1:
	print('1 1\n0')
else:
	stdout.write('2 ' + str(n) + '\n')
	m = []
	for i in range(1, n):
		mod = a[i] % n
		m.append(mod * (n - 1))
		a[i] += m[-1]
	for i in range(n - 1):
		stdout.write(str(m[i]) + ' ')
	stdout.write('\n')
stdout.write('1 ' + str(n) + '\n')
a[0] = 0
for i in range(n):
	stdout.write(str(-a[i]) + ' ')
stdout.write('\n')


from collections import defaultdict as dc
import math
import sys
input = sys.stdin.readline
n = int(input())
l = list(map(int, input().split()))
if n > 1:
	p = [0] * n
	q = [0] * (n - 1)
	r = [0] * 1
	for i in range(n - 1):
		p[i] = -1 * l[i] * n
		q[i] = l[i] * (n - 1)
	r[0] = -l[n - 1] - n
	p[n - 1] = n
	print(1, n - 1)
	for i in range(n - 2):
		print(q[i], end=' ')
	print(q[-1])
	print(1, n)
	for i in range(n - 1):
		print(p[i], end=' ')
	print(p[-1])
	print(n, n)
	print(r[0])
else:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-l[0])


N = int(input())
A = list(map(int, input().split()))
if N == 1:
	print(1, 1)
	print(-A[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-A[0])
	print(2, N)
	for a in A[1:]:
		print((a - N) * (N - 1), end=' ')
	print()
	print(1, N)
	print(0, end=' ')
	for a in A[1:]:
		print((N - 1 - a) * N, end=' ')


from math import *

def is_even(p):
	n = len(p)
	count = 0
	for i in range(n):
		index = p.index(i, i, n)
		if i == index:
			pass
		else:
			count += 1
			temp = p[i]
			p[i] = p[index]
			p[index] = temp
	if count % 2 == 0:
		return True
	else:
		return False
prime = []

def SieveOfEratosthenes():
	global prime
	prime = [1] * 2000010
	prime[1] = 0
	p = 2
	while p * p <= 2000001:
		if prime[p]:
			for i in range(p * p, 2000002, p):
				prime[i] = 0
lpf = []

def precompute():
	global lpf
	lpf = [0] * 1000001
	for i in range(2, 1000001):
		if not lpf[i]:
			for j in range(i, 1000001, i):
				if not lpf[j]:
					lpf[j] = i

def binpow(a, b):
	res = 1
	while b > 0:
		if b & 1:
			res *= a
		a *= a
		b >>= 1
	return res

def modpow(a, b, x):
	res = 1
	while b > 0:
		if b & 1:
			res *= a
			res %= x
		a *= a
		a %= x
		b >>= 1
	return res
cont = []

def f(x):
	global cont
	total = 0
	for i in cont:
		total += abs(i - x)
	return total

def bs(uv, low, high, target):
	while low + 3 < high:
		mid = (low + high) / 2
		if uv[mid] < target:
			low = mid
		else:
			high = mid - 1
	for i in range(high, low - 1, -1):
		if uv[i] < target:
			return i
	return -1

def ternary_search(l, r):
	while r - l > 10:
		m1 = l + (r - l) / 3
		m2 = r - (r - l) / 3
		f1 = f(m1)
		f2 = f(m2)
		if f1 > f2:
			l = m1
		else:
			r = m2
	mino = f(l)
	for i in range(l, r + 1):
		mino = min(mino, f(i))
	return mino
n = int(input())
arr = [int(i) for i in input().split()]
if n == 1:
	print('1 1')
	print(-1 * arr[0])
	print('1 1')
	print(0)
	print('1 1')
	print(0)
else:
	print(1, n)
	for i in range(n):
		print(-1 * n * arr[i], end=' ')
		arr[i] -= n * arr[i]
	print()
	print(1, n - 1)
	for i in range(n - 1):
		print(-1 * arr[i], end=' ')
		arr[i] = 0
	print()
	print(2, n)
	for i in range(1, n):
		print(-1 * arr[i], end=' ')
		arr[i] = 0
	print()


import math
n = int(input())
l = [int(i) for i in input().split()]
print(1, 1)
print(-l[0])
l[0] = 0
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(2, n)
	for i in range(1, n):
		print(l[i] * (n - 1), end=' ')
		l[i] *= n
	print()
	print(1, n)
	for i in range(n):
		print(-l[i], end=' ')


n = int(input())
liste = list(map(int, input().split(' ')))
answer = []
if n == 1:
	a = liste[0]
	answer = ['1 1', str(-a), '1 1', str(a), '1 1', str(-a)]
else:
	answer.append('1 ' + str(n))
	answer.append(' '.join([str(-n * liste[i]) for i in range(n)]))
	answer.append('1 1')
	answer.append(str((n - 1) * liste[0]))
	answer.append('2 ' + str(n))
	answer.append(' '.join([str((n - 1) * liste[i]) for i in range(1, n)]))
print('\n'.join(answer))


from sys import stdin
input = stdin.readline
n = int(input())
a = [*map(lambda x: int(x), input().split())]
if n != 1:
	print('{0} {0}'.format(n))
	print(a[n - 1] * (n - 1))
	print('1 {}'.format(n - 1))
	print(*map(lambda x: x * (n - 1), a[:n - 1]))
else:
	print('1 1')
	print('0')
	print('1 1')
	print('0')
print('1 {}'.format(n))
print(*map(lambda x: x * n * -1, a))


import os
import sys
from io import BytesIO, IOBase
import threading
from collections import defaultdict, Counter, deque
from math import factorial as fac

def main():
	n = int(input())
	arr = list(map(int, input().split()))
	if n == 1:
		print(f'{1} {1}')
		print(-arr[0])
		print(f'{1} {1}')
		print(0)
		print(f'{1} {1}')
		print(0)
	else:
		val = []
		print(f'{1} {n}')
		for i in range(n):
			val.append(n * arr[i] * -1)
		print(*val, sep=' ')
		val.clear()
		print(f'{1} {n - 1}')
		for i in range(n - 1):
			val.append((n - 1) * arr[i])
		print(*val, sep=' ')
		print(f'{n} {n}')
		print((n - 1) * arr[n - 1])
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


import sys
input = sys.stdin.readline
n = int(input())
arr = list(map(int, input().split()))
g = []
for i in range(n - 1):
	t = arr[i] % n
	g.append(t * (n - 1))
	arr[i] += t * (n - 1)
if n == 1:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
elif n == 2:
	print(1, 1)
	print(-arr[0])
	print(2, 2)
	print(-arr[1])
	print(1, 1)
	print(0)
else:
	print(1, n - 1)
	print(*g)
	print(n, n)
	print(-(arr[-1] % n))
	arr[-1] += -(arr[-1] % n)
	g = []
	for num in arr:
		g.append(-num)
	print(1, n)
	print(*g)


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-1 * a[-1])
else:
	print(1, n - 1)
	first = []
	for i in range(n - 1):
		first.append(a[i] * (n - 1))
	print(*first)
	print(n, n)
	print(n - a[-1])
	print(1, n)
	second = []
	for i in range(n - 1):
		second.append(-1 * a[i] * n)
	second.append(-1 * n)
	print(*second)


import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
inv = 0
for i in range(1, n):
	if (n - 1) * i % n == 1:
		inv = i
		break
print(1, 1)
print(-a[0])
a[0] = 0
print(2, n)
op = []
for i in range(1, n):
	x = -a[i] * inv % n * (n - 1)
	op.append(x)
	a[i] += x
print(*op)
print(1, n)
op = [-x for x in a]
print(*op)


n = int(input().strip())
l = list(map(int, input().split(' ')))
print(1, 1)
print(-1 * l[0])
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
elif n == 2:
	print(2, 2)
	print(-1 * l[1])
	print(1, 2)
	print(0, 0)
else:
	l[0] = 0
	print(2, n)
	for i in range(1, n):
		k = l[i] % n
		l[i] += k * (n - 1)
		print(k * (n - 1), end=' ')
	print()
	print(1, n)
	for i in l:
		print(-1 * i, end=' ')


import sys
input = sys.stdin.readline
for _ in range(1):
	n = int(input())
	arr = [int(j) for j in input().split()]
	if n <= 3:
		for i in range(1, n + 1):
			print(i, i)
			print(-1 * arr[i - 1])
		for i in range(3 - n):
			print(1, 1)
			print(0)
	elif n % 2 == 0 or n % 2 == 1:
		print(1, n - 1)
		for i in range(0, n - 1):
			print(arr[i] * (n - 1), end=' ')
		print(1, n)
		for i in range(n):
			print(-1 * (n * arr[i]), end=' ')
		print()
		temp = arr[-1]
		temp += -1 * (n * arr[-1])
		print(n, n)
		print(-1 * temp)


import sys
import math

def II():
	return int(sys.stdin.readline())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def MI():
	return map(int, sys.stdin.readline().split())

def SI():
	return sys.stdin.readline().strip()
n = II()
a = LI()
if n == 1:
	print(1, 1)
	print(a[0] % n)
	a[0] += a[0] % n
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	exit(0)
ans1 = []
ans2 = []
ans3 = []
for i in range(n - 1):
	if a[i] % n == 0:
		ans1.append(0)
	else:
		ans1.append((n - 1) * (a[i] % n))
	a[i] += ans1[-1]
for i in range(1, n):
	if a[i] % n == 0:
		ans2.append(0)
	else:
		ans2.append((n - 1) * (a[i] % n))
	a[i] += ans2[-1]
for i in range(n):
	ans3.append(-1 * a[i])
print(1, n - 1)
print(*ans1)
print(2, n)
print(*ans2)
print(1, n)
print(*ans3)


def solve(number, len):
	x = len - number
	if (number + x * (len - 1)) % len == 0:
		return x
	else:
		x = len + number
		return x
LEN = int(input())
arr = list(map(int, input().split()))
if LEN != 1:
	y = arr[-1]
	arr = arr[:-1]
	m = LEN - 1
	print(1, m)
	new_arr = []
	for i in arr:
		x = solve(i, LEN)
		new_arr.append(x * (LEN - 1) + i)
		print(x * (LEN - 1), end=' ')
	print()
	print(LEN, LEN)
	print(-(y % LEN))
	y = y - y % LEN
	print(1, LEN)
	for i in new_arr:
		print(-i, end=' ')
	print(-y)
else:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


n = int(input())
vals = list(map(int, input().split()))
if n >= 2:
	print(1, n)
	ans = [-i * n for i in vals]
	print(*ans)
	print(2, n)
	a1 = [i * (n - 1) for i in vals[1:n]]
	print(*a1)
	print(1, 1)
	print(vals[0] * (n - 1))
else:
	print(1, 1)
	print(-vals[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


n = int(input())
a = list(map(int, input().split()))
print(1, 1)
print(-a[0])
a[0] = 0
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n)
	for x in a:
		print(-(x % (n - 1) * n), end=' ')
	print()
	print(2, n)
	for x in a[1:]:
		print(-(x - x % (n - 1) * n), end=' ')


t = int(input())
l = list(map(int, input().split()))
sec_step = []
print(t, t)
print(t - l[-1])
for i in l[:t - 1]:
	sec_step.append((t - 1) * i)
if t != 1:
	print(1, t - 1)
	print(*sec_step)
else:
	print(1, 1)
	print(0)
print(1, t)
sec_step.append(-t)
for i in range(len(sec_step) - 1):
	sec_step[i] = -sec_step[i] - l[i]
print(*sec_step)


import sys, math
input = sys.stdin.readline

def getInts():
	return [int(s) for s in input().split()]

def getInt():
	return int(input())

def getStrs():
	return [s for s in input().split()]

def getStr():
	return input().strip()

def listStr():
	return list(input().strip())
import collections as col
import math

def solve():
	N = getInt()
	A = getInts()
	print(1, 1)
	print(-A[0])
	if N == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	A[0] = 0
	print(2, N)
	arr = []
	for j in range(1, N):
		arr.append((N - 1) * A[j])
		A[j] *= -N
	print(*arr)
	print(1, N)
	print(*A)
	return
solve()


(n, arr, t) = (int(input()), [int(i) for i in input().split()], [])
if n == 1:
	(print(1, 1, '\n', -1 * arr[0], '\n', 1, 1, '\n', 0, '\n', 1, 1, '\n', 0), exit())
print(1, n)
for i in range(n):
	t.append((n - 1 - arr[i] % (n - 1)) * n)
	arr[i] += t[i]
for i in range(n):
	(print(t[i]),)
print('\n', 1, n - 1)
for i in range(n - 1):
	(print(arr[i] * -1),)
print('\n', n, n, '\n', arr[n - 1] * -1)


import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nsmallest
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
from decimal import Decimal
mod = pow(10, 9) + 7

def data():
	return sys.stdin.readline().strip()

def out(var):
	sys.stdout.write(str(var) + '\n')

def outa(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def l():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]
n = int(data())
arr = l()
if n == 1:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
answer = [0] * (n - 1)
print(1, n - 1)
mod = [0] * n
for i in range(-100000, 100000):
	temp = i * (n - 1)
	mod[temp % n] = temp
for i in range(n - 1):
	if arr[i] % n == 0:
		continue
	temp = n - arr[i] % n
	answer[i] = mod[temp]
	arr[i] += mod[temp]
print(*answer)
answer = [0] * (n - 1)
print(2, n)
for i in range(1, n):
	if arr[i] % n == 0:
		continue
	temp = n - arr[i] % n
	answer[i - 1] = mod[temp]
	arr[i] += mod[temp]
print(*answer)
print(1, n)
answer = [0] * n
for i in range(n):
	answer[i] = -arr[i]
print(*answer)


import math
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
mod = 10 ** 9 + 7
mod1 = 998244353
sys.setrecursionlimit(300000)
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
sys.setrecursionlimit(300000)

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

class TreeNode:

	def __init__(self, k, v):
		self.key = k
		self.value = v
		self.left = None
		self.right = None
		self.parent = None
		self.height = 1
		self.num_left = 1
		self.num_total = 1

class AvlTree:

	def __init__(self):
		self._tree = None

	def add(self, k, v):
		if not self._tree:
			self._tree = TreeNode(k, v)
			return
		node = self._add(k, v)
		if node:
			self._rebalance(node)

	def _add(self, k, v):
		node = self._tree
		while node:
			if k < node.key:
				if node.left:
					node = node.left
				else:
					node.left = TreeNode(k, v)
					node.left.parent = node
					return node.left
			elif node.key < k:
				if node.right:
					node = node.right
				else:
					node.right = TreeNode(k, v)
					node.right.parent = node
					return node.right
			else:
				node.value = v
				return

	@staticmethod
	def get_height(x):
		return x.height if x else 0

	@staticmethod
	def get_num_total(x):
		return x.num_total if x else 0

	def _rebalance(self, node):
		n = node
		while n:
			lh = self.get_height(n.left)
			rh = self.get_height(n.right)
			n.height = max(lh, rh) + 1
			balance_factor = lh - rh
			n.num_total = 1 + self.get_num_total(n.left) + self.get_num_total(n.right)
			n.num_left = 1 + self.get_num_total(n.left)
			if balance_factor > 1:
				if self.get_height(n.left.left) < self.get_height(n.left.right):
					self._rotate_left(n.left)
				self._rotate_right(n)
			elif balance_factor < -1:
				if self.get_height(n.right.right) < self.get_height(n.right.left):
					self._rotate_right(n.right)
				self._rotate_left(n)
			else:
				n = n.parent

	def _remove_one(self, node):
		replacement = node.left or node.right
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = replacement
			else:
				node.parent.right = replacement
			replacement.parent = node.parent
			node.parent = None
		else:
			self._tree = replacement
			replacement.parent = None
		node.left = None
		node.right = None
		node.parent = None
		self._rebalance(replacement)

	def _remove_leaf(self, node):
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = None
			else:
				node.parent.right = None
			self._rebalance(node.parent)
		else:
			self._tree = None
		node.parent = None
		node.left = None
		node.right = None

	def remove(self, k):
		node = self._get_node(k)
		if not node:
			return
		if AvlTree._is_leaf(node):
			self._remove_leaf(node)
			return
		if node.left and node.right:
			nxt = AvlTree._get_next(node)
			node.key = nxt.key
			node.value = nxt.value
			if self._is_leaf(nxt):
				self._remove_leaf(nxt)
			else:
				self._remove_one(nxt)
			self._rebalance(node)
		else:
			self._remove_one(node)

	def get(self, k):
		node = self._get_node(k)
		return node.value if node else -1

	def _get_node(self, k):
		if not self._tree:
			return None
		node = self._tree
		while node:
			if k < node.key:
				node = node.left
			elif node.key < k:
				node = node.right
			else:
				return node
		return None

	def get_at(self, pos):
		x = pos + 1
		node = self._tree
		while node:
			if x < node.num_left:
				node = node.left
			elif node.num_left < x:
				x -= node.num_left
				node = node.right
			else:
				return (node.key, node.value)
		raise IndexError('Out of ranges')

	@staticmethod
	def _is_left(node):
		return node.parent.left and node.parent.left == node

	@staticmethod
	def _is_leaf(node):
		return node.left is None and node.right is None

	def _rotate_right(self, node):
		if not node.parent:
			self._tree = node.left
			node.left.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.left
			node.left.parent = node.parent
		else:
			node.parent.right = node.left
			node.left.parent = node.parent
		bk = node.left.right
		node.left.right = node
		node.parent = node.left
		node.left = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	def _rotate_left(self, node):
		if not node.parent:
			self._tree = node.right
			node.right.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.right
			node.right.parent = node.parent
		else:
			node.parent.right = node.right
			node.right.parent = node.parent
		bk = node.right.left
		node.right.left = node
		node.parent = node.right
		node.right = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	@staticmethod
	def _get_next(node):
		if not node.right:
			return node.parent
		n = node.right
		while n.left:
			n = n.left
		return n

class SegmentTree1:

	def __init__(self, data, default=0, func=lambda a, b: max(a, b)):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class SegmentTree:

	def __init__(self, data, default=0, func=lambda a, b: a + b):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class Factorial:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorials = [1, 1]
		self.invModulos = [0, 1]
		self.invFactorial_ = [1, 1]

	def calc(self, n):
		if n <= -1:
			print('Invalid argument to calculate n!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.factorials):
			return self.factorials[n]
		nextArr = [0] * (n + 1 - len(self.factorials))
		initialI = len(self.factorials)
		prev = self.factorials[-1]
		m = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * i % m
		self.factorials += nextArr
		return self.factorials[n]

	def inv(self, n):
		if n <= -1:
			print('Invalid argument to calculate n^(-1)')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		p = self.MOD
		pi = n % p
		if pi < len(self.invModulos):
			return self.invModulos[pi]
		nextArr = [0] * (n + 1 - len(self.invModulos))
		initialI = len(self.invModulos)
		for i in range(initialI, min(p, n + 1)):
			next = -self.invModulos[p % i] * (p // i) % p
			self.invModulos.append(next)
		return self.invModulos[pi]

	def invFactorial(self, n):
		if n <= -1:
			print('Invalid argument to calculate (n^(-1))!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.invFactorial_):
			return self.invFactorial_[n]
		self.inv(n)
		nextArr = [0] * (n + 1 - len(self.invFactorial_))
		initialI = len(self.invFactorial_)
		prev = self.invFactorial_[-1]
		p = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * self.invModulos[i % p] % p
		self.invFactorial_ += nextArr
		return self.invFactorial_[n]

class Combination:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorial = Factorial(MOD)

	def ncr(self, n, k):
		if k < 0 or n < k:
			return 0
		k = min(k, n - k)
		f = self.factorial
		return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD

def powm(a, n, m):
	if a == 1 or n == 0:
		return 1
	if n % 2 == 0:
		s = powm(a, n // 2, m)
		return s * s % m
	else:
		return a * powm(a, n - 1, m) % m

def sort_list(list1, list2):
	zipped_pairs = zip(list2, list1)
	z = [x for (_, x) in sorted(zipped_pairs)]
	return z

def product(l):
	por = 1
	for i in range(len(l)):
		por *= l[i]
	return por

def binarySearchCount(arr, n, key):
	left = 0
	right = n - 1
	count = 0
	while left <= right:
		mid = int((right + left) / 2)
		if arr[mid] < key:
			count = mid + 1
			left = mid + 1
		else:
			right = mid - 1
	return count

def countdig(n):
	c = 0
	while n > 0:
		n //= 10
		c += 1
	return c

def binary(x, length):
	y = bin(x)[2:]
	return y if len(y) >= length else '0' * (length - len(y)) + y

def countGreater(arr, n, k):
	l = 0
	r = n - 1
	leftGreater = n
	while l <= r:
		m = int(l + (r - l) / 2)
		if arr[m] >= k:
			leftGreater = m
			r = m - 1
		else:
			l = m + 1
	return n - leftGreater
n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(l[0])
	print(1, 1)
	print(l[0])
	print(1, 1)
	print(-3 * l[0])
	sys.exit(0)
print(1, 1)
print(-l[0])
print(2, n)
w = []
l[0] = 0
for i in range(1, n):
	w.append(l[i] * (n - 1))
	l[i] += w[-1]
	l[i] = -l[i]
print(*w)
print(1, n)
print(*l)


import sys
import math

def readStr():
	return sys.stdin.readline().rstrip()

def readInts():
	return list(map(int, readStr().split(' ')))

def readLatins():
	return [ord(c) - 97 for c in readStr()]

def main(n, a):
	print(1, 1)
	d0 = -a[0]
	print(d0)
	a[0] += d0
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	print(2, n)
	for i in range(1, n):
		di = (n - 1) * (a[i] % n)
		print(di, end=' ')
		a[i] += di
	print()
	print(1, n)
	for i in range(n):
		di = -a[i]
		print(di, end=' ')
		a[i] -= di
	print()
(n,) = readInts()
a = readInts()
main(n, a)


import sys
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2 ** 62 - 1

def read_int():
	return int(buff_readline())

def read_int_n():
	return list(map(int, buff_readline().split()))

def read_float():
	return float(buff_readline())

def read_float_n():
	return list(map(float, buff_readline().split()))

def read_str():
	return readline().strip()

def read_str_n():
	return readline().strip().split()

def error_print(*args):
	print(*args, file=sys.stderr)

def mt(f):
	import time

	def wrap(*args, **kwargs):
		s = time.time()
		ret = f(*args, **kwargs)
		e = time.time()
		error_print(e - s, 'sec')
		return ret
	return wrap

def divisor(n):
	for i in range(1, int(n ** 0.5) + 1):
		if n % i == 0:
			yield i
			if i != n // i:
				yield (n // i)

@mt
def slv(N, A):
	if N == 1:
		print(1, 1)
		print(-A[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	a = A[:]
	na = a[:]
	error_print([-na[i] % N for i in range(N)])
	for i in range(N - 1):
		if a[i] > 0:
			na[i] = a[i] + a[i] % N * (N - 1)
		else:
			na[i] = a[i] - (N - a[i] % N) * (N - 1)
	print(1, N - 1)
	print(*[na[i] - a[i] for i in range(N - 1)])
	a = na[:]
	for i in range(N - 1, N):
		if a[i] > 0:
			na[i] = a[i] - a[i] % N
		else:
			na[i] = a[i] - a[i] % N
	print(N, N)
	print(*[na[i] - a[i] for i in range(N - 1, N)])
	print(1, N)
	print(*[-na[i] for i in range(N)])
	error_print(na)
	error_print([-na[i] % N for i in range(N)])

def main():
	N = read_int()
	A = read_int_n()
	slv(N, A)
main()


n = int(input())
a = list(map(int, input().strip().split()))[:n]
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	x = [0] * n
	y = [0] * n
	for i in range(1, n):
		y[i] = -(a[i] % n)
		x[i] = (a[i] + y[i]) // n - y[i]
		y[i] *= -(n - 1)
		x[i] *= -n
	print(1, 1)
	print(-a[0])
	print(1, n)
	for i in x:
		print(i, end=' ')
	print()
	print(2, n)
	for i in y[1:]:
		print(i, end=' ')


import sys
input = sys.stdin.readline
n = int(input())
A = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(1)
	print(1, 1)
	print(1)
	print(1, 1)
	print(-A[0] - 2)
	sys.exit()
print(1, n)
B = [n * (n - 1 - a % (n - 1)) for a in A]
print(*B)
C = [-A[i] - B[i] for i in range(n)]
print(1, 1)
print(C[0])
print(2, n)
print(*C[1:])


import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])
	exit()
print(1, 1)
print(-a[0])
a[0] = 0
print(2, n)
b = []
for i in range(1, n):
	b.append(a[i] % n * (n - 1))
	a[i] += a[i] % n * (n - 1)
print(*b)
print(1, n)
print(*[-ai for ai in a])


from sys import stdin

class Input:

	def __init__(self):
		self.lines = stdin.read().splitlines()
		self.counter = 0

	def line(self):
		try:
			return self.lines[self.counter]
		finally:
			self.counter += 1

	def array(self, sep=' ', cast=int):
		return list(map(cast, self.line().split(sep=sep)))

	def known_tests(self):
		(num_of_cases,) = self.array()
		for case in range(num_of_cases):
			yield self

	def unknown_tests(self):
		while self.counter < len(self.lines):
			yield self

class Problem:

	def __init__(self, input):
		(n,) = input.array()
		a = input.array()
		if n == 1:
			print(1, 1)
			print(0)
		else:
			print(2, n)
			print(*tuple([a[i] * (n - 1) for i in range(1, n)]))
		print(1, n)
		print(*tuple([-a[i] * n for i in range(n)]))
		print(1, 1)
		print(-(a[0] - a[0] * n))
for tc in Input().unknown_tests():
	Problem(tc)


n = int(input())
a = list(map(int, input().split()))
t = []
if n >= 2:
	print(1, '', n - 1)
	for i in range(n - 1):
		if a[i] % (n - 1) == 0:
			t.append(-a[i])
			a[i] = 0
		else:
			t.append(a[i] * (n - 1))
			a[i] = a[i] + a[i] * (n - 1)
	for i in range(n - 1):
		print(t[i], end=' ')
	print(n, '', n)
	print(-a[-1])
	a[-1] = 0
	print(1, '', n)
	for i in range(n):
		print(-a[i], end=' ')
else:
	print(1, '', 1)
	print(-a[0])
	print(1, '', 1)
	print(0)
	print(1, '', 1)
	print(0)


import sys
n = int(input())
arr = list(map(int, sys.stdin.readline().strip().split()))
if n == 1:
	sys.stdout.write('1 1 \n0 \n1 1\n0 \n1 1\n{}\n'.format(-arr[0]))
else:
	sys.stdout.write('1 1\n{}\n'.format(-arr[0]))
	sys.stdout.write('1 {}\n{}\n'.format(n, ' '.join([str(0 if i == 0 else -n * arr[i]) for i in range(n)])))
	sys.stdout.write('2 {}\n{}\n'.format(n, ' '.join([str((n - 1) * arr[i]) for i in range(1, n)])))


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-1 * a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(2, n)
	for i in range(1, n):
		if a[i] % n != 0:
			val1 = a[i] % n
			val = (n - 1) * val1
			print(val, end=' ')
			a[i] = val + a[i]
		else:
			print(0, end=' ')
	print()
	print(1, n)
	print(0, end=' ')
	for i in range(1, n):
		print(-1 * a[i], end=' ')
	print()
	print(1, 1)
	print(-1 * a[0])


n = int(input())
b = input()
a = [int(d) for d in b.split()]
if n > 1:
	print(1, n - 1)
	for i in range(0, n - 1):
		b = a[i] * (n - 1)
		a[i] *= n
		print(b, end=' ')
	print()
else:
	print('1 1\n0')
print(1, n)
for i in range(0, n):
	if i != n - 1:
		print(-a[i], end=' ')
	else:
		print(-(a[i] - a[i] % n), end=' ')
		a[i] %= n
print()
print(n, n)
print(-a[n - 1], end=' ')
print()


n = int(input())
li = list(map(int, input().split()))
if n == 1:
	print('1 1')
	print(-1 * li[0])
	print('1 1')
	print('0')
	print('1 1')
	print('0')
if n == 2:
	print('1 1')
	print(-1 * li[0])
	print('2 2')
	print(-1 * li[1])
	print('1 1')
	print('0')
if n >= 3:
	print('1 1')
	print(-1 * li[0])
	print(2, n)
	for i in range(1, n):
		print(li[i] % n * (n - 1), end=' ')
		li[i] += li[i] % n * (n - 1)
	print()
	print(1, n)
	li[0] = 0
	for i in range(0, n):
		print(-1 * li[i], end=' ')


import sys
import math
from bisect import bisect_right as br
from decimal import Decimal
from itertools import combinations as cb

def int_arr():
	return list(map(int, sys.stdin.readline().strip().split()))

def str_arr():
	return list(map(str, sys.stdin.readline().strip().split()))

def input():
	return sys.stdin.readline().strip()
n = int(input())
arr = int_arr()
if n == 1:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
print(1, n - 1)
for i in range(n - 1):
	print(arr[i] * (n - 1), end=' ')
print()
print(1, n)
for i in range(n - 1):
	print(-arr[i] * n, end=' ')
print(0, end='')
print()
print(n, n)
print(-arr[-1])


import sys
import string
import math
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
from fractions import Fraction

def mi(s):
	return map(int, s.strip().split())

def lmi(s):
	return list(mi(s))

def tmi(s):
	return tuple(mi(s))

def mf(f, s):
	return map(f, s)

def lmf(f, s):
	return list(mf(f, s))

def js(lst):
	return ' '.join((str(d) for d in lst))

def jsns(lst):
	return ''.join((str(d) for d in lst))

def line():
	return sys.stdin.readline().strip()

def linesp():
	return line().split()

def iline():
	return int(line())

def mat(n):
	matr = []
	for _ in range(n):
		matr.append(linesp())
	return matr

def matns(n):
	mat = []
	for _ in range(n):
		mat.append([c for c in line()])
	return mat

def mati(n):
	mat = []
	for _ in range(n):
		mat.append(lmi(line()))
	return mat

def pmat(mat):
	for row in mat:
		print(js(row))

def main():
	n = iline()
	arr = lmi(line())
	if n == 1:
		print(1, 1)
		print(-arr[-1])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	print(n, n)
	assert -arr[-1] % 1 == 0
	print(-arr[-1])
	print(1, n - 1)
	for i in range(n - 1):
		assert arr[i] * (n - 1) % (n - 1) == 0
		k = arr[i] * (n - 1)
		arr[i] += k
		print(k, end=' ')
	print()
	print(1, n)
	for i in range(n):
		if i == n - 1:
			print(0)
		else:
			assert arr[i] % n == 0
			print(-arr[i], end=' ')
main()


from sys import stdin
input = stdin.readline

def A():
	t = int(input())
	for _ in range(t):
		d = [0] * 26
		n = int(input())
		for j in range(n):
			for i in input().rstrip():
				d[ord(i) - ord('a')] += 1
		truth = True
		for i in range(26):
			if d[i] % n != 0:
				truth = False
				break
		if truth:
			print('YES')
		else:
			print('NO')

def B():
	n = int(input())
	a = sorted(list(map(int, input().split())))
	baseCost = sum(a) - n
	c = 2
	cost = 0
	while True:
		cost = 0
		for i in range(n):
			cost += abs(a[i] - c ** i)
		if cost < baseCost:
			c += 1
			baseCost = cost
		else:
			break
	print(baseCost)

def C():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print(1, 1)
		print(-1 * a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	k = [(n - 1 - a[i] % (n - 1)) * n for i in range(n)]
	print(1, n)
	print(*k)
	print(1, 1)
	print(-1 * (k[0] + a[0]))
	print(2, n)
	print(*[-1 * (k[i] + a[i]) for i in range(1, n)])
C()


n = int(input())
L = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-L[0])
else:
	print(1, n - 1)
	for i in range(n - 1):
		print(L[i] * (n - 1), end=' ')
	print()
	print(n, n)
	print(-L[n - 1])
	print(1, n)
	for i in range(n - 1):
		print(-L[i] * n, end=' ')
	print(0)


import os
import sys
from io import BytesIO, IOBase

def main():
	pass
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def binary(n):
	return bin(n).replace('0b', '')

def decimal(s):
	return int(s, 2)

def pow2(n):
	p = 0
	while n > 1:
		n //= 2
		p += 1
	return p

def isPrime(n):
	if n == 1:
		return False
	else:
		root = int(n ** 0.5)
		root += 1
		for i in range(2, root):
			if n % i == 0:
				return False
		return True
n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-l[0])
elif n == 2:
	print(1, 1)
	print(-l[0])
	print(2, 2)
	print(-l[1])
	print(1, 2)
	print(0, 0)
elif n == 3:
	print(1, 1)
	print(-l[0])
	print(2, 2)
	print(-l[1])
	print(3, 3)
	print(-l[2])
else:
	print(1, n)
	for i in range(0, n):
		print(-n * l[i], end=' ')
	l[-1] = l[-1] - n * l[-1]
	print('')
	print(1, n - 1)
	for i in range(0, n - 1):
		print((n - 1) * l[i], end=' ')
	print('')
	print(n, n)
	print(-l[-1])


from collections import Counter
for i in range(1):
	n = int(input())
	if n > 1:
		a = [int(X) for X in input().split()]
		print(1, n)
		print(*[-1 * a[i] * n for i in range(n)])
		print(1, n - 1)
		print(*[(n - 1) * a[i] for i in range(n - 1)])
		print(n, n)
		print((n - 1) * a[-1])
	else:
		print(1, 1)
		print(-1 * int(input()))
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)


n = int(input())
a = [int(x) for x in input().split()]
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-1 * a[0])
	exit()
firstSum = []
for i in range(n - 1):
	v = a[i]
	m = v % n * (n - 1)
	firstSum.append(m)
	a[i] += m
print(1, n - 1)
print(*firstSum)
print(n, n)
print(-1 * (a[-1] % n))
a[-1] -= a[-1] % n
print(1, n)
for i in range(n):
	a[i] *= -1
print(*a)


n = int(input())
l = list([int(x) for x in input().split()])
if n == 1:
	print('1 1')
	print(-1 * l[0])
	print('1 1')
	print('0')
	print('1 1')
	print('0')
else:
	print('1 1')
	print(-1 * l[0])
	l[0] = 0
	print(2, n, sep=' ')
	res = list()
	for i in range(1, n):
		v = l[i] * (n - 1)
		l[i] += l[i] * (n - 1)
		res.append(v)
		print(v, end=' ')
	print()
	print(1, n, end=' ')
	print()
	for i in range(n):
		print(-1 * l[i], end=' ')


N = int(input())
A = list(map(int, input().split()))
if N == 1:
	print(1, 1)
	print(A[0])
	print(1, 1)
	print(-A[0])
	print(1, 1)
	print(-A[0])
else:
	print(1, N - 1)
	llist = []
	for i in range(0, N - 1):
		t = A[i] % N
		llist.append((N - 1) * t)
		A[i] += (N - 1) * t
	print(*llist)
	print(N, N)
	print(N - A[N - 1] % N)
	A[N - 1] += N - A[N - 1] % N
	print(1, N)
	for i in range(N):
		print(-A[i], end=' ')
	print()


n = int(input())
a = list(map(int, input().split()))

def gcd(a, b):
	if b % a == 0:
		x = 1
		y = 0
	else:
		(x1, y1) = gcd(b % a, a)
		x = y1 - b // a * x1
		y = x1
	return (x, y)
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	(x, y) = gcd(n - 1, n)
	l1 = 1
	r1 = n - 1
	l2 = 1
	r2 = n
	l3 = n
	r3 = n
	print(l1, r1)
	for i in range(n - 1):
		print(-x * (n - 1) * a[i], end=' ')
	print()
	print(l2, r2)
	for i in range(n - 1):
		print(-y * n * a[i], end=' ')
	print(0)
	print(l3, r3)
	print(-a[-1])


n = int(input())
a = list(map(int, input().split()))
b = []
if n == 1:
	print('1 1')
	print(n - a[0] % n)
	a[0] = a[0] + n - a[0] % n
	print('1 1')
	print(n - a[0] % n)
	a[0] = a[0] + n - a[0] % n
	print('1 1')
	print(-a[0])
else:
	for k in range(n - 1):
		b.append(a[k] % n * (n - 1))
		a[k] = a[k] + a[k] % n * (n - 1)
	print('1', n - 1)
	print(' '.join(map(str, b)))
	print(n, n)
	print(n - a[n - 1] % n)
	a[n - 1] = a[n - 1] + n - a[n - 1] % n
	print('1', n)
	for k in range(n):
		a[k] = -1 * a[k]
	print(' '.join(map(str, a)))


n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-l[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-l[0])
	ls = [0]
	for i in range(1, n):
		ls.append(-n * l[i])
	print(1, n)
	print(' '.join(map(str, ls)))
	ls = []
	for i in range(1, n):
		ls.append((n - 1) * l[i])
	print(2, n)
	print(' '.join(map(str, ls)))


from sys import stdin
n = int(stdin.readline().strip())
s = list(map(int, stdin.readline().strip().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-s[0])
	exit(0)
d = [-1 for i in range(n)]
for i in range(2 * n):
	x = i * (n - 1) % n
	if d[x] == -1:
		d[x] = i
print(1, n - 1)
ans = []
for i in range(n - 1):
	y = (n - s[i]) % n
	s[i] += d[y] * (n - 1)
	ans.append(d[y] * (n - 1))
print(*ans)
print(2, n)
ans = []
for i in range(1, n):
	y = (n - s[i]) % n
	s[i] += d[y] * (n - 1)
	ans.append(d[y] * (n - 1))
print(*ans)
print(1, n)
ans = []
for i in range(n):
	ans.append(-s[i])
print(*ans)


def extended_gcd(a, b):
	(old_r, r) = (a, b)
	(old_s, s) = (1, 0)
	(old_t, t) = (0, 1)
	while r:
		quotient = old_r // r
		(old_r, r) = (r, old_r - quotient * r)
		(old_s, s) = (s, old_s - quotient * s)
		(old_t, t) = (t, old_t - quotient * t)
	assert old_s * a + old_t * b == 1
	return (old_s, old_t)
n = int(input())
a = [int(i) for i in input().split()]
print(n, n)
print(-a[-1])
a[-1] = 0
(s, t) = extended_gcd(n, n - 1)
print(1, n)
b = []
for a_i in a:
	b.append(str(-a_i * s * n))
print(' '.join(b))
a.pop()
if n != 1:
	print(1, n - 1)
	b = []
	for a_i in a:
		b.append(str(-a_i * t * (n - 1)))
	print(' '.join(b))
else:
	print(1, 1)
	print(0)


def ext_gcd(a, b, x, y):
	if b == 0:
		x[0] = 1
		y[0] = 0
		return a
	d = ext_gcd(b, a % b, y, x)
	y[0] -= a // b * x[0]
	return d
n = int(input())
al = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(al[0] * -1)
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
if n == 2:
	print(1, 1)
	print(al[0] * -1)
	print(2, 2)
	print(al[1] * -1)
	print(1, 1)
	print(0)
	exit()
if n == 3:
	print(1, 1)
	print(al[0] * -1)
	print(2, 2)
	print(al[1] * -1)
	print(3, 3)
	print(al[2] * -1)
	exit()
rem = n - al[0]
print(1, 1)
print(rem)
al[0] = n
x = [0]
y = [0]
ext_gcd(n - 1, n, x, y)
(x, y) = (x[0], y[0])
ans2 = []
ans3 = [-1 * n]
for a in al[1:]:
	v = x * -1 * a * (n - 1)
	ans2.append(v)
	ans3.append((a + v) * -1)
print(2, n)
print(*ans2)
print(1, n)
print(*ans3)


import os
import sys
from io import BytesIO, IOBase

def getans(a, b, c):
	if b == 0 and a == 1:
		return [c, 0]
	else:
		tt = getans(b, a % b, c)
		pp = []
		pp.append(tt[1])
		pp.append(tt[0] - a // b * tt[1])
		return pp

def main():
	n = int(input())
	a = list(map(int, input().split(' ')))
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	else:
		first = []
		second = []
		for x in range(n - 1):
			cc = getans(n, n - 1, -a[x])
			if cc[0] * n - cc[1] * (n - 1) == -a[x]:
				first.append(cc[1] * (n - 1))
				second.append(-cc[0] * n)
			elif cc[0] * n + cc[1] * (n - 1) == -a[x]:
				first.append(cc[1] * (n - 1))
				second.append(cc[0] * n)
			elif -cc[0] * n + cc[1] * (n - 1) == -a[x]:
				first.append(-cc[1] * (n - 1))
				second.append(cc[0] * n)
			elif -cc[0] * n - cc[1] * (n - 1) == -a[x]:
				first.append(-cc[1] * (n - 1))
				second.append(-cc[0] * n)
		second.append(0)
		print(1, n - 1)
		print(*first)
		print(1, n)
		print(*second)
		print(n, n)
		print(-a[n - 1])
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


import sys
import math
input = sys.stdin.readline

def gcd(a, b):
	if a == 0 or b == 0:
		return a + b
	if a > b:
		return gcd(a % b, b)
	else:
		return gcd(a, b % a)

def nsk(a, b):
	return a * b // gcd(a, b)
N = int(input())
A = list(map(int, input().split(' ')))
if N == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-A[0])
	exit(0)
X = nsk(N, N - 1)
print(1, N - 1)
add = [A[i] % N * (N - 1) for i in range(N - 1)]
print(' '.join(map(str, add)))
for i in range(N - 1):
	A[i] += add[i]
print(N, N)
print(X - A[N - 1])
A[N - 1] = X
print(1, N)
print(' '.join(map(str, (-a for a in A))))


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def RL():
	return map(int, sys.stdin.readline().rstrip().split())

def RLL():
	return list(RL())

def N():
	return int(input())

def comb(n, m):
	return factorial(n) / (factorial(m) * factorial(n - m)) if n >= m else 0

def perm(n, m):
	return factorial(n) // factorial(n - m) if n >= m else 0

def mdis(x1, y1, x2, y2):
	return abs(x1 - x2) + abs(y1 - y2)

def toord(c):
	return ord(c) - ord('a')

def lcm(a, b):
	return a * b // gcd(a, b)
mod = 998244353
INF = float('inf')
from math import factorial, sqrt, ceil, floor, gcd
from collections import Counter, defaultdict, deque
from heapq import heapify, heappop, heappush

def main():
	n = N()
	arr = RLL()
	if n == 1:
		print(1, 1)
		print(-arr[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	else:
		print(1, 1)
		print(-arr[0])
		print(1, n)
		res1 = [-arr[i] * n for i in range(0, n)]
		res1[0] = 0
		print(*res1)
		print(2, n)
		print(*[arr[i] * (n - 1) for i in range(1, n)])
main()


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print('1 1', -a[0], '1 1', '0', '1 1', '0', sep='\n')
else:
	print('1 1')
	print(-a[0])
	b = [1, n]
	print(*b)
	print('0', end=' ')
	for i in range(1, n):
		print(-n * a[i], end=' ')
	print()
	b = [2, n]
	print(*b)
	for i in range(1, n):
		print((n - 1) * a[i], end=' ')


import sys
from collections import defaultdict as dd
from collections import Counter as cc
from queue import Queue
import math
import itertools
try:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
except:
	pass
input = lambda : sys.stdin.buffer.readline().rstrip()
q = int(input())
w = list(map(int, input().split()))
if q == 1:
	print(1, 1)
	print(-w[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-w[0])
	print(2, q)
	print(*[(q - 1) * w[i] for i in range(1, q)])
	print(1, q)
	print(*[0] + [-q * w[i] for i in range(1, q)])


n = int(input())
import math
nums = [int(x) for x in input().strip().split()]
change1 = []
for i in range(n - 1):
	change1.append(nums[i] % n * (n - 1))
change2 = []
for i in range(n - 1):
	new = nums[i] + change1[i]
	new *= -1
	change2.append(str(new))
change3 = n - nums[-1] % n
change2.append(str(-1 * (change3 + nums[-1])))
for i in range(n - 1):
	change1[i] = str(change1[i])
if len(change1) == 0:
	change1 = ['0']
print(1, max(n - 1, 1))
print(' '.join(change1))
print(n, n)
print(change3)
print(1, n)
print(' '.join(change2))


n = int(input())
m = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-m[0])
	for i in range(2):
		print(1, 1)
		print(0)
else:
	ans = [[] for i in range(3)]
	v = [(1, n - 1), (2, n), (1, n)]
	for i in range(n - 1):
		ans[0].append(m[i] % n * (n - 1))
		m[i] += m[i] % n * (n - 1)
	for i in range(1, n):
		ans[1].append(m[i] % n * (n - 1))
		m[i] += m[i] % n * (n - 1)
	for i in range(n):
		ans[2].append(-m[i])
	for i in range(3):
		print(v[i][0], v[i][1])
		print(*ans[i])


import sys
import math
import heapq
import collections

def inputnum():
	return int(input())

def inputnums():
	return map(int, input().split())

def inputlist():
	return list(map(int, input().split()))

def inputstring():
	return [x for x in input()]

def inputstringnum():
	return [ord(x) - ord('a') for x in input()]

def inputmatrixchar(rows):
	arr2d = [[j for j in input().strip()] for i in range(rows)]
	return arr2d

def inputmatrixint(rows):
	arr2d = []
	for _ in range(rows):
		arr2d.append([int(i) for i in input().split()])
	return arr2d
n = inputnum()
a = inputlist()
print(1, n)
for i in range(n):
	print(-n * a[i], end=' ')
print()
print(1, n - 1 + (n == 1))
for i in range(n - 1 + (n == 1)):
	print((n - 1) * a[i], end=' ')
print()
print(n, n)
print((n - 1) * a[n - 1])


n = int(input())
xs = [int(x) for x in input().split()]
ans = []
for i in range(len(xs) - 1):
	c = (n - 1) * xs[i]
	ans.append(c)
if n == 1:
	print(1, 1)
	print(0)
else:
	print(1, n - 1)
	print(' '.join((str(x) for x in ans)))
print(n, n)
print((n - 1) * xs[-1])
print(1, n)
ans = []
for x in xs:
	c = -n * x
	ans.append(c)
print(' '.join((str(x) for x in ans)))


import math
from collections import deque
from sys import stdin, stdout
from string import ascii_letters
letters = ascii_letters
input = stdin.readline
n = int(input())
arr = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-arr[0])
	exit(0)
print(2, n)
for i in range(1, n):
	print(arr[i] * (n - 1), end=' ')
print()
print(1, n)
print('0', end=' ')
for i in range(1, n):
	print(-(arr[i] * n), end=' ')
print()
print(1, 1)
print(-arr[0])


n = int(input())
num = list(map(int, input().split()))
if n < 4:
	count = 3
	for i in range(n):
		print(i + 1, i + 1)
		print(-num[i])
		count -= 1
	while count > 0:
		print(1, 1)
		print(0)
		count -= 1
else:
	print(1, n - 1)
	print(*(num[i] * (n - 1) for i in range(n - 1)))
	print(n, n)
	print(-num[-1])
	num[-1] = 0
	print(1, n)
	print(*(-i * n for i in num))


import sys
import math
import collections
from sys import stdin, stdout, setrecursionlimit
import bisect as bs
setrecursionlimit(2 ** 20)
M = 10 ** 9 + 7
T = 1
for _ in range(T):
	n = int(stdin.readline())
	a = list(map(int, stdin.readline().split()))
	if n == 1:
		print('1 1')
		print(-a[0])
		print('1 1')
		print(0)
		print('1 1')
		print(0)
		continue
	print(1, n - 1)
	for i in range(n - 1):
		r = a[i] % n
		print(r * (n - 1), end=' ')
		a[i] += r * (n - 1)
	print('')
	print(n, n)
	print(-a[-1])
	a[-1] = 0
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')


import sys
CONST_A = 10 ** 18
n = int(input())
arr = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	sys.exit()
if n == 2:
	print(1, 1)
	print(-arr[0])
	print(2, 2)
	print(-arr[1])
	print(1, 1)
	print(0)
	sys.exit()
if n == 3:
	print(1, 1)
	print(-arr[0])
	print(2, 2)
	print(-arr[1])
	print(3, 3)
	print(-arr[2])
	sys.exit()
brr = [i % n for i in arr]
ans1 = []
for (num, i) in enumerate(arr[:-1]):
	t = i + (n - 1) * brr[num]
	if t <= CONST_A:
		ans1.append((n - 1) * brr[num])
		arr[num] = t
	else:
		ans1.append(-(n - 1) * (n - brr[num]))
		arr[num] = i - (n - 1) * (n - brr[num])
print(1, n - 1)
print(*ans1)
print(2, n)
print(*[0 for _ in range(n - 2)], end=' ')
t = arr[-1] + (n - 1) * brr[-1]
if t <= CONST_A:
	print((n - 1) * brr[-1])
	arr[-1] = t
else:
	print(-(n - 1) * (n - brr[-1]))
	arr[-1] = arr[-1] - (n - 1) * (n - brr[-1])
print(1, n)
print(*[-i for i in arr])


t = int(input())
arr = list(map(int, input().strip().split()))[:t]
if t == 1:
	print('1 1')
	x = -arr[0]
	print(x)
	print('1 1')
	print(0)
	print('1 1')
	print(0)
else:
	print('1 1')
	x = -arr[0]
	print(x)
	str3 = str(t)
	str1 = '1 ' + str3
	print(str1)
	l1 = [0]
	for i in range(1, t):
		y = -(t * arr[i])
		l1.append(y)
	print(*l1, sep=' ')
	str4 = str(t)
	str2 = '2 ' + str4
	print(str2)
	l2 = []
	for i in range(1, t):
		y = (t - 1) * arr[i]
		l2.append(y)
	print(*l2, sep=' ')


import math

def main():
	n = int(input())
	lst = list(map(int, input().split()))
	line1 = '1 ' + str(n) + '\n0 '
	line2 = '2 ' + str(n) + '\n'
	line3 = '1 1\n' + str(-lst[0])
	for i in range(1, n):
		if lst[i] % (n - 1) != 0:
			line1 += str(-n * (lst[i] % (n - 1)))
			lst[i] -= n * (lst[i] % (n - 1))
		else:
			line1 += '0'
		line1 += ' '
	for i in range(1, n):
		line2 += str(-lst[i]) + ' '
	if n > 1:
		print(line1)
		print(line2)
	else:
		print('1 1\n0\n1 1\n0')
	print(line3)
t = 1
for i in range(t):
	main()


from math import ceil

def cnter(arr):
	if arr == []:
		return False
	ans = list(map(lambda s: s % len(arr), arr))
	if ans.count(0) == len(arr) or len(arr) == 1:
		return True
	return False

def multiples(arr):
	if len(arr) <= 3:
		print(1, 1)
		print(-arr[0])
		if len(arr) >= 2:
			print(2, 2)
			print(-arr[1])
		else:
			print(1, 1)
			print(0)
		if len(arr) >= 3:
			print(3, 3)
			print(-arr[2])
		else:
			print(1, 1)
			print(0)
		return ''
	print(1, len(arr))
	for i in range(0, len(arr)):
		if i == len(arr) - 1:
			print(0)
		else:
			print(-arr[i] * len(arr), end=' ')
	print('')
	print(1, len(arr) - 1)
	for i in range(0, len(arr) - 1):
		print(arr[i] * (len(arr) - 1), end=' ')
	print('')
	print(len(arr), len(arr))
	print(-arr[-1])
	return ''
a = input()
lst = list(map(int, input().strip().split()))
print(multiples(lst))


N = int(input())
A = list(map(int, input().split()))
print(1, 1)
print((N - 1) * A[0])
if N >= 2:
	print(2, N)
	print(*[(N - 1) * A[i] for i in range(1, N)])
else:
	print(1, 1)
	print(0)
print(1, N)
print(*[-N * A[i] for i in range(N)])


n = int(input())
alst = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(alst[0] * -1)
	print(1, 1)
	print(alst[0] * -1)
	print(1, 1)
	print(alst[0])
else:
	print(1, n)
	row = []
	for (i, a) in enumerate(alst):
		tmp = (a - 1) % (n - 1) + 1
		plus = (n - 1 - tmp) * n
		row.append(plus)
		alst[i] += plus
	print(*row)
	print(1, 1)
	print(-1 * alst[0])
	print(2, n)
	row = []
	for a in alst[1:]:
		row.append(a * -1)
	print(*row)


mod = 10 ** 9 + 7

def solve():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print(1, 1)
		print(0)
	else:
		print(1, n - 1)
		for i in range(0, n - 1):
			print(a[i] * (n - 1), end=' ')
			a[i] = a[i] * n
		print()
	print(n, n)
	print(-a[n - 1])
	a[n - 1] = 0
	print(1, n)
	for i in range(n):
		a[i] = -a[i]
	print(*a)
t = 1
while t > 0:
	solve()
	t -= 1


n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-1 * l[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-1 * l[0])
	l[0] = 0
	print(2, n)
	for i in range(2, n + 1):
		c = l[i - 1]
		a = (n - 1) * (l[i - 1] % n)
		b = (n - 1) * l[i - 1]
		l[i - 1] = b + c
		print(b, end=' ')
	print()
	print(1, n)
	for i in range(len(l)):
		print(-1 * l[i], end=' ')
		l[i] = 0
	print()


n = int(input())
a = list(map(int, input().split(' ')))
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
elif n == 2:
	print(1, 1)
	print(-a[0])
	print(2, 2)
	print(-a[1])
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-a[0])
	a[0] = 0
	b = []
	for i in range(1, len(a)):
		moda = a[i] % n
		c = moda * (n - 1)
		b.append(c)
		a[i] += c
	print(2, n)
	print(' '.join(list(map(str, b))))
	print(1, n)
	b = []
	for i in a:
		b.append(-i)
	print(' '.join(list(map(str, b))))


import sys

def main():
	n = int(input())
	A = [int(a) for a in input().split()]
	if n == 1:
		print('1 1')
		print(-A[0])
		print('1 1')
		print(0)
		print('1 1')
		print(0)
		return
	print(f'1 {n - 1}')
	B = []
	for i in range(n - 1):
		B.append(A[i] * (n - 1))
	print(' '.join(map(str, B)))
	print(f'{n} {n}')
	print(-A[-1])
	print(f'1 {n}')
	C = []
	for i in range(n - 1):
		C.append(-(A[i] + B[i]))
	C.append(0)
	print(' '.join(map(str, C)))
main()


n = int(input())
a = list(map(int, input().split()))
if n > 3:
	print(1, n - 1)
	stroka = ''
	b = []
	for i in a[:n - 1]:
		stroka += str(i * (n - 1)) + ' '
		b.append(i * n)
	print(stroka)
	print(1, n)
	stroka2 = ''
	for i in b:
		stroka2 += str(-i) + ' '
	stroka2 += '0'
	print(stroka2)
	print(n, n)
	print(-a[n - 1])
else:
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	if n == 2:
		print(1, 1)
		print(-a[0])
		print(2, 2)
		print(-a[1])
		print(1, 1)
		print(0)
	if n == 3:
		print(1, 1)
		print(-a[0])
		print(2, 2)
		print(-a[1])
		print(3, 3)
		print(-a[2])


def euclidean_algo(a, b):
	if not a:
		return (0, 1, b)
	(x, y, gcd) = euclidean_algo(b % a, a)
	return (y - b // a * x, x, gcd)
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
if n == 2:
	print(1, 1)
	print(-a[0])
	print(2, 2)
	print(-a[1])
	print(1, 1)
	print(0)
	exit()
if True:
	num = n - 1
	print(1, n - 1)
	(x, y, z) = euclidean_algo(n, n - 1)
	for i in range(n - 1):
		print(-((n - 1) * y * a[i]), end=' ')
		a[i] -= (n - 1) * y * a[i]
	print()
	print(n, n)
	print(-a[-1])
	a[-1] = 0
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')
	print()


from functools import lru_cache
from sys import stdin, stdout
import sys
from math import *
sys.setrecursionlimit(int(200000.0 + 10))
n = int(input())
ar = list(map(int, input().split()))
print(1, 1)
print(-1 * ar[0])
if n <= 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(2, n)
	for i in range(1, n):
		print((n - 1) * (ar[i] % n), end=' ')
	print(1, n)
	print('0', end=' ')
	for i in range(1, n):
		print(-1 * (ar[i] + (n - 1) * (ar[i] % n)), end=' ')
	print()


from math import ceil
from collections import deque, defaultdict
from heapq import heapify, heappop, heappush
INF = float('inf')
it = lambda : list(map(int, input().strip().split()))

def output(l, r, v):
	print(l, r)
	print(' '.join(map(str, v)))

def solve():
	n = int(input())
	A = it()
	if n == 1:
		output(1, 1, [-A[0]])
		output(1, 1, [0])
		output(1, 1, [0])
	else:
		output(1, 1, [(n - 1) * A[0]])
		output(2, n, [(n - 1) * A[i] for i in range(1, n)])
		output(1, n, [-n * A[i] for i in range(n)])
solve()


n = int(input())
a = [int(a) for a in input().split()]
if n == 1:
	print(f'1 1\n{-a[0]}\n1 1\n0\n1 1\n0')
else:
	output = f'1 {n}\n'
	for i in range(n):
		to_sum = a[i] % (n - 1) * n
		if (a[i] + to_sum) % (n - 1) == 0:
			a[i] += to_sum
			output += f'{to_sum} '
		else:
			a[i] -= to_sum
			output += f'-{to_sum} '
	output += f'\n1 {n - 1}\n'
	for i in range(n - 1):
		output += str(-a[i]) + ' '
	output += f'\n{n} {n}\n {-a[n - 1]}'
	print(output)


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print('1 1', -a[0], '1 1', 0, '1 1', 0, sep='\n')
	exit(0)
print('1 1', n - a[0] % n, sep='\n')
a[0] += n - a[0] % n
pref = [0] * n
cur = n - 1
for q in range(n):
	pref[q * cur % n] = q
print(min(2, n), n)
for i in range(1, n):
	rem = (n - a[i] % n) % n
	a[i] += cur * pref[rem]
	print(cur * pref[rem], end=' ')
print('')
print(1, n)
for i in range(n):
	print(-a[i], end=' ')


import sys
import math
import bisect
import heapq
from bisect import bisect_right
from sys import stdin, stdout

def get_ints_in_variables():
	return map(int, sys.stdin.readline().strip().split())

def get_int():
	return int(sys.stdin.readline())

def get_ints_in_list():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_list_of_list(n):
	return [list(map(int, sys.stdin.readline().strip().split())) for _ in range(n)]

def get_string():
	return sys.stdin.readline().strip()

def Solution():
	n = get_int()
	arr = get_ints_in_list()
	if n == 1:
		print(1, 1)
		print(-arr[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	print(1, n - 1)
	for i in range(n - 1):
		print(arr[i] * (n - 1), end=' ')
		arr[i] = arr[i] * n
	print()
	print(n, n)
	print(arr[n - 1] * (n - 1))
	arr[n - 1] = arr[n - 1] * n
	print(1, n)
	for i in range(n):
		print(-arr[i], end=' ')
		arr[i] = 0
	print()

def main():
	Solution()
main()


n = int(input())
arr = [int(x) for x in input().split()]
if n > 1:
	print(str(1) + ' ' + str(n - 1))
	for i in range(0, n - 1):
		k = arr[i] % n
		if i > 0:
			print(' ', end='')
		print((n - 1) * k, end='')
		arr[i] += (n - 1) * k
	print()
	print(str(n) + ' ' + str(n))
	print(n - arr[n - 1] % n)
	arr[n - 1] += n - arr[n - 1] % n
	print(str(1) + ' ' + str(n))
	for i in range(0, n):
		k = -arr[i]
		if i > 0:
			print(' ', end='')
		print(k, end='')
	print()
else:
	print('1 1')
	print(-arr[0])
	print('1 1')
	print(0)
	print('1 1')
	print(0)


from sys import stdin, stdout
n = int(input())
a = list(map(int, stdin.readline().split()))
if n > 1:
	print(1, n)
	for i in range(n):
		if a[i] > 0:
			print(-1 * n * a[i], end=' ')
			a[i] -= n * a[i]
		elif a[i] < 0:
			print(-1 * n * a[i], end=' ')
			a[i] += -1 * n * a[i]
		else:
			print(0, end=' ')
	print()
	print(1, n - 1)
	for i in range(n - 1):
		print(a[i] * -1, end=' ')
	print()
	print(n, n)
	print(-1 * a[n - 1])
else:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-1 * a[0])


from sys import stdin
import sys
n = int(stdin.readline())
N = n
a = list(map(int, stdin.readline().split()))
if n == 1:
	print(1, 1)
	print(-1 * a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	sys.exit()
print(1, n)
b = []
for i in range(n):
	b.append((N - 1 - a[i] % (N - 1)) * N)
	a[i] += b[-1]
print(*b)
print(1, n - 1)
c = []
for i in range(n - 1):
	c.append(-1 * a[i])
	if a[i] % (n - 1) != 0:
		pass
print(*c)
print(n, n)
print(-1 * a[-1])


n = int(input())
li = [int(i) for i in input().split()]
if n == 1:
	print('1 1')
	print('51')
	print('1 1')
	print('51')
	li[0] += 102
	print('1 1')
	print(-li[0])
else:
	size = 1
	print('1 1')
	if li[0] == 0:
		print(n)
		li[0] = n
	if li[0] % n == 0:
		a = n
		if li[0] + a != 0:
			print(a)
			li[0] += a
		else:
			print(2 * a)
			li[0] += 2 * a
	else:
		a = n - li[0]
		print(a)
		li[0] = li[0] + a
	size = n - 1
	print('2', n)
	for i in range(1, n):
		m = li[i] % n
		print(m * size, end=' ')
		li[i] = li[i] + m * size
	print()
	print('1', n)
	for i in li:
		print(-i, end=' ')


n = int(input())
u = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-u[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
print(1, n - 1)
c1 = []
for i in range(n - 1):
	c1.append(u[i] * (n - 1))
	u[i] += u[i] * (n - 1)
print(' '.join(map(str, c1)))
print(1, n)
c2 = []
for i in range(n - 1):
	c2.append(-u[i])
c2.append(0)
print(' '.join(map(str, c2)))
print(n, n)
print(-u[-1])


MOD = 1000000007
from collections import defaultdict as dd, Counter, deque

def si():
	return input()

def ii():
	return int(input())

def li():
	return list(map(int, input().split()))

def mi():
	return map(int, input().split())

def out(v):
	print(v)

def spout():
	print(v, end=' ')

def d2b(n):
	return bin(n).replace('0b', '')

def twod(n, m, num):
	return [[num for x in range(m)] for y in range(n)]

def vow():
	return ['a', 'e', 'i', 'o', 'u']

def let():
	return [chr(i) for i in range(97, 123)]

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def ispow2(x):
	return x and (not x & x - 1)

def prime_factors(n):
	i = 2
	factors = []
	while i * i <= n:
		if n % i:
			i += 1
		else:
			n //= i
			factors.append(i)
	if n > 1:
		factors.append(n)
	return list(factors)
n = ii()
a = li()
print('1 1')
print(0 - a[0])
a[0] = 0
if n == 1:
	print('1 1')
	print(0)
	print('1 1')
	print(0)
	exit()
print(2, n)
for i in range(1, n):
	print((n - 1) * a[i], end=' ')
	a[i] += (n - 1) * a[i]
print('')
print(1, n)
for i in range(n):
	print(0 - a[i], end=' ')


n = int(input())
l = [int(x) for x in input().split(' ')]
print(1, 1)
print(-1 * l[0])
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
elif n == 2:
	print(2, 2)
	print(-1 * l[1])
	print(1, 2)
	print(0, 0)
else:
	l[0] = 0
	print(2, n)
	for i in range(1, n):
		k = l[i] % n
		l[i] += k * (n - 1)
		print(k * (n - 1), end=' ')
	print()
	print(1, n)
	for i in l:
		print(-1 * i, end=' ')


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	ra = [x % n for x in a]
	print(1, n - 1)
	for i in range(n - 1):
		if i == n - 2:
			print(ra[i] * (n - 1))
			a[i] += ra[i] * (n - 1)
		else:
			print(ra[i] * (n - 1), end=' ')
			a[i] += ra[i] * (n - 1)
	print(n, n)
	print(n - a[n - 1])
	a[n - 1] = n
	print(1, n)
	for j in range(n):
		if j != n - 1:
			print(-a[j], end=' ')
		else:
			print(-a[j])


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-a[-1])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n)
	l = []
	for i in range(n - 1):
		l.append((n - a[i] % n) * (n - 1) - a[i])
		a[i] = a[i] + l[-1]
	l.append(0)
	print(' '.join(map(str, l)))
	last = a.pop()
	print(1, n - 1)
	print(' '.join(map(lambda x: str(-x), a)))
	print(n, n)
	print(-last)


n = int(input())
l1 = [int(x) for x in input().split()]
if n != 1:
	print(1, len(l1))
	old = l1[-1]
	l2 = [(n - x % (n - 1) - 1) * int(x % (n - 1) != 0) * n for x in l1]
	print(*l2)
	print(1, len(l1) - 1)
	print(*[-l1[x] - l2[x] for x in range(n - 1)])
	print(len(l1), len(l1))
	print(-l2[-1] - old)
else:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-l1[0])


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from math import gcd, ceil

def pre(s):
	n = len(s)
	pi = [0] * n
	for i in range(1, n):
		j = pi[i - 1]
		while j and s[i] != s[j]:
			j = pi[j - 1]
		if s[i] == s[j]:
			j += 1
		pi[i] = j
	return pi

def prod(a):
	ans = 1
	for each in a:
		ans = ans * each
	return ans

def lcm(a, b):
	return a * b // gcd(a, b)

def binary(x, length=16):
	y = bin(x)[2:]
	return y if len(y) >= length else '0' * (length - len(y)) + y
from math import inf
for _ in range(int(input()) if not True else 1):
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		for i in range(2):
			print(1, 1)
			print(1)
		a[0] += 2
		a[0] = -a[0]
		print(1, 1)
		print(a[0])
		continue
	print(1, n - 1)
	b = [0] * (n - 1)
	for i in range(n - 1):
		b[i] = a[i] % n * (n - 1)
		a[i] += b[i]
	print(*b)
	print(n, n)
	print((n - a[-1] % n) % n)
	a[-1] += (n - a[-1] % n) % n
	for i in range(n):
		a[i] = -a[i]
	print(1, n)
	print(*a)


import sys

def input():
	return sys.stdin.readline().rstrip()

def input_split():
	return [int(i) for i in input().split()]
n = int(input())
arr = input_split()
first = [-n * x for x in arr]
if n > 1:
	second = [(n - 1) * x for x in arr[:-1]]
else:
	second = [0]
third = [arr[-1] * (n - 1)]
print('{} {}'.format(1, n))
print(*first, sep=' ')
print('{} {}'.format(1, max(n - 1, 1)))
print(*second, sep=' ')
print('{} {}'.format(n, n))
print(*third, sep=' ')


N = int(input())
array = [int(x) for x in input().split()]
if N == 1:
	print(1, 1)
	print(-array[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, N - 1)
	tobeprinted = []
	for i in range(N - 1):
		tobeprinted.append(array[i] * (N - 1))
	print(*tobeprinted)
	print(N, N)
	print(-array[-1])
	print(1, N)
	array = [-N * x for x in array[0:N - 1]] + [0]
	print(*array)


total = int(input())
num_l = list(map(int, input().split()))
if total == 1:
	print('1 1')
	print(-num_l[0])
	print('1 1')
	print('0')
	print('1 1')
	print('0')
elif total == 2:
	print('1 1')
	print(-num_l[0])
	print('2 2')
	print(-num_l[1])
	print('1 1')
	print('0')
else:
	print('1 ' + str(total - 1))
	mul1 = total - 1
	mul1_l = []
	for count in range(total - 1):
		mul1_l.append(mul1 * num_l[count])
	print(*mul1_l)
	print('1 ' + str(total))
	mul2 = total
	mul2_l = []
	for count in range(total - 1):
		mul2_l.append(-mul2 * num_l[count])
	mul2_l += [0]
	print(*mul2_l)
	print(str(total) + ' ' + str(total))
	print(-num_l[total - 1])


import sys
_INPUT_LINES = sys.stdin.read().splitlines()
inp = iter(_INPUT_LINES).__next__
inar = lambda : list(map(int, inp().split()))
inin = lambda : int(inp())
inst = lambda : inp().decode().strip()
_T_ = 1
for _t_ in range(_T_):
	n = inin()
	a = inar()
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		break
	print(n, n)
	print(-a[-1])
	a[-1] -= a[-1]
	print(1, n - 1)
	for i in range(n - 1):
		print(a[i] * (n - 1), end=' ')
		a[i] += a[i] * (n - 1)
	print()
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')
		a[i] -= a[i]
	print()


n = int(input())
num = list(map(int, input().split()))
print('1 1')
x = []
if n != 1:
	print(-num[0])
	num[0] = num[0] - num[0]
	for i in range(1, n):
		x.append(num[i] % n * (n - 1))
		num[i] += x[i - 1]
		num[i] *= -1
	print('2 {}'.format(n))
	for c in x:
		print(c, end=' ')
	print('\n1 {}'.format(n))
	for d in num:
		print(d, end=' ')
else:
	print('0\n1 1\n0\n1 1\n{}'.format(-1 * num[0]))


n = int(input())
a = [int(i) for i in input().split()]
if n > 1:
	print(1, n - 1)
	for i in range(0, n - 1):
		z = a[i] % n * (n - 1)
		a[i] += z
		print(z, end=' ')
	print()
	print(n, n)
	print(-a[n - 1])
	a[n - 1] = 0
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')
else:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)


import math
n = int(input())
arr = list(map(int, input().split()))
if n == 1:
	print('1 1', 0, '1 1', 0, '1 1', -1 * arr[0], sep='\n')
else:
	print(2, n)
	for j in range(1, n):
		print(arr[j] * (n - 1), end=' ')
	print()
	print(1, 1)
	print(arr[0] * (n - 1))
	print(1, n)
	for j in range(n):
		print(-1 * arr[j] * n, end=' ')


def inp():
	return int(input())

def inlist():
	return list(map(int, input().split()))

def main():
	n = inp()
	a = inlist()
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		print(1, 1)
		print(-a[0])
		return
	print(1, n - 1)
	for i in range(0, n - 1):
		rem = abs(a[i]) % n
		if a[i] < 0:
			print(-1 * rem * (n - 1), end=' ')
			a[i] -= rem * (n - 1)
		else:
			print(rem * (n - 1), end=' ')
			a[i] += rem * (n - 1)
	print()
	print(2, n)
	for i in range(1, n):
		rem = abs(a[i]) % n
		if a[i] < 0:
			print(-1 * rem * (n - 1), end=' ')
			a[i] -= rem * (n - 1)
		else:
			print(rem * (n - 1), end=' ')
			a[i] += rem * (n - 1)
	print()
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')
	print()
main()


n = int(input())
a = list(map(int, input().split()))
p = print
if n < 2:
	p('1 1', -a[0], '1 1', 0, '1 1', 0, sep='\n')
	quit()
p(1, n)
b = []
for i in range(n - 1):
	b.append(-n * (a[i] % (n - 1)))
p(' '.join(map(str, b)), 0)
p(1, n - 1)
p(' '.join((str(-a[i] - b[i]) for i in range(n - 1))))
p(n, n)
p(-a[-1])


n = int(input())
a = [int(x) for x in input().split()]
if n > 1:
	print('1 {}'.format(n - 1))
	print(' '.join([str((n - 1) * a[x]) for x in range(0, n - 1)]))
else:
	print('1 1\n0')
print('{} {}'.format(n, n))
print(str(-a[n - 1]))
print('1 {}'.format(n))
print(' '.join([str(-n * a[x]) for x in range(0, n - 1)] + ['0']))


from collections import *
import sys

def ri():
	return int(input())

def rl():
	return list(map(int, input().split()))
n = ri()
aa = rl()
if n == 1:
	print(1, 1)
	print(-aa[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
elif n == 2:
	print(1, 1)
	print(-aa[0])
	print(2, 2)
	print(-aa[1])
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-aa[0])
	print(2, n)
	add = []
	for i in range(1, n):
		add.append(-aa[i] * -1 * (n - 1))
	print(*add)
	add2 = [0]
	print(1, n)
	for i in range(1, n):
		add2.append(-add[i - 1] - aa[i])
	print(*add2)


from bisect import bisect_left
import os
import sys
from io import BytesIO, IOBase
from collections import Counter, defaultdict
from collections import deque
from functools import cmp_to_key
import math

def sin():
	return input()

def ain():
	return list(map(int, sin().split()))

def sain():
	return input().split()

def iin():
	return int(sin())
MAX = float('inf')
MIN = float('-inf')
MOD = 1000000007

def sieve(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	s = set()
	for p in range(2, n + 1):
		if prime[p]:
			s.add(p)
	return s

def readTree(n, m):
	adj = [deque([]) for _ in range(n + 1)]
	for _ in range(m):
		(u, v) = ain()
		adj[u].append(v)
		adj[v].append(u)
	return adj

def main():
	n = iin()
	l = ain()
	if n <= 2:
		if n == 1:
			print(1, 1)
			print(-1 * l[0])
			print(1, 1)
			print(0)
			print(1, 1)
			print(0)
		else:
			print(1, 1)
			print(-1 * l[0])
			print(2, 2)
			print(-1 * l[1])
			print(1, 2)
			print(0, 0)
	else:
		print(1, 1)
		print(-1 * l[0])
		l[0] = 0
		print(2, n)
		for i in range(1, n):
			x = l[i] % n * (n - 1)
			l[i] += x
			print(x, end=' ')
		print()
		print(1, n)
		for i in range(n):
			print(-1 * l[i], end=' ')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
if os.getcwd() == 'D:\\code':
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
	input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


n = int(input())
a = [int(s) for s in input().split(' ')]
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-a[0])
	print(1, n)
	second = '0 '
	for i in range(2, n + 1):
		second += str(-n * a[i - 1]) + ' '
	print(second[:-1])
	print(2, n)
	third = ''
	for i in range(2, n + 1):
		third += str((n - 1) * a[i - 1]) + ' '
	print(third[:-1])


n = int(input())
a = list(map(int, input().split()))
if n < 4:
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	elif n == 2:
		print(1, 1)
		print(-a[0])
		print(2, 2)
		print(-a[1])
		print(2, 2)
		print(0)
	else:
		print(1, 1)
		print(-a[0])
		print(2, 2)
		print(-a[1])
		print(3, 3)
		print(-a[2])
	exit()
h1 = 1
h2 = n - 1
ah1 = [0] * h1
ah2 = [0] * h2
i = 0
while i < h1:
	ah1[i * n % h1] = i * n
	i += 1
i = 0
while i < h2:
	ah2[i * n % h2] = i * n
	i += 1
print(1, h1)
i = 0
while i < h1:
	print(ah1[a[i] % h1] - a[i], end=' ')
	a[i] = ah1[a[i] % h1]
	i += 1
print()
print(h1 + 1, n)
while i < n:
	print(ah2[a[i] % h2] - a[i], end=' ')
	a[i] = ah2[a[i] % h2]
	i += 1
print()
print(1, n)
i = 0
while i < n:
	print(-a[i], end=' ')
	i += 1
print()


def fact(x):
	if x == 0:
		return 1
	else:
		return x * fact(x - 1)

def lower_bound(li, num):
	answer = -1
	start = 0
	end = len(li) - 1
	while start <= end:
		middle = (end + start) // 2
		if li[middle] >= num:
			answer = middle
			end = middle - 1
		else:
			start = middle + 1
	return answer

def upper_bound(li, num):
	answer = -1
	start = 0
	end = len(li) - 1
	while start <= end:
		middle = (end + start) // 2
		if li[middle] <= num:
			answer = middle
			start = middle + 1
		else:
			end = middle - 1
	return answer

def abs(x):
	return x if x >= 0 else -x

def binary_search(li, val, lb, ub):
	ans = 0
	while lb <= ub:
		mid = (lb + ub) // 2
		if li[mid] > val:
			ub = mid - 1
		elif val > li[mid]:
			lb = mid + 1
		else:
			ans = 1
			break
	return ans

def kadane(x):
	sum_so_far = 0
	current_sum = 0
	for i in x:
		current_sum += i
		if current_sum < 0:
			current_sum = 0
		else:
			sum_so_far = mpos(sum_so_far, current_sum)
	return sum_so_far

def pref(li):
	pref_sum = [0]
	for i in li:
		pref_sum.append(pref_sum[-1] + i)
	return pref_sum
from math import *
for _ in range(1):
	n = int(input())
	a = list(map(int, input().split()))
	print(1, 1)
	print(-a[0])
	if n > 1:
		print(2, n)
		ans = []
		for i in range(1, n):
			ans.append(a[i] * (n - 1))
			a[i] += ans[-1]
			a[i] = -a[i]
		a[0] = 0
		print(*ans)
		print(1, n)
		print(*a)
	else:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)


from collections import defaultdict, deque, Counter
from sys import stdin, stdout
from heapq import heappush, heappop
import math
import io
import os
import math
import bisect

def isPrime(x):
	for i in range(2, x):
		if i * i > x:
			break
		if x % i == 0:
			return False
	return True

def ncr(n, r, p):
	num = den = 1
	for i in range(r):
		num = num * (n - i) % p
		den = den * (i + 1) % p
	return num * pow(den, p - 2, p) % p

def primeFactors(n):
	l = []
	while n % 2 == 0:
		l.append(2)
		n = n / 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			l.append(int(i))
			n = n / i
	if n > 2:
		l.append(n)
	return list(set(l))

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def sieve(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime

def digits(n):
	c = 0
	while n > 0:
		n //= 10
		c += 1
	return c

def ceil(n, x):
	if n % x == 0:
		return n // x
	return n // x + 1

def mapin():
	return map(int, input().split())
n = int(input())
l = [int(x) for x in input().split()]
ll = []
if n == 1:
	print(1, 1)
	print(-l[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	for i in range(n - 1):
		ll.append(l[i] * (n - 1))
		l[i] = l[i] * n
	print(1, n - 1)
	print(*ll)
	print(n, n)
	print(-l[-1])
	l[-1] = 0
	ll = []
	print(1, n)
	for i in range(n):
		ll.append(-l[i])
	print(*ll)


import math
n = int(input())
ints = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
else:
	print(1, n - 1)
	res = [None for i in range(n - 1)]
	for i in range(n - 1):
		val = abs(ints[i]) % n * (n - 1)
		res[i] = int(math.copysign(val, ints[i]))
		ints[i] += res[i]
	print(' '.join(map(str, res)))
print(n, n)
print(n - ints[n - 1])
ints[n - 1] += n - ints[n - 1]
print(1, n)
for i in range(n):
	ints[i] *= -1
print(' '.join(map(str, ints)), end=' ')


def main():
	n = int(input())
	a = tuple(map(int, input().split()))
	operations = find_operations_necessary_to_make_zeros(a)
	for operation in operations:
		print(*operation[0])
		print(*operation[1])

def find_operations_necessary_to_make_zeros(seq):
	seq = tuple(seq)
	seq_length = len(seq)
	if seq_length == 1:
		x = seq[0]
		operation_a = ((1, 1), [-x * 1])
		operation_b = ((1, 1), [0])
		operation_c = ((1, 1), [0])
		result = (operation_a, operation_b, operation_c)
		return result
	operation_a = ((1, seq_length - 1), [x * (seq_length - 1) for x in seq[:-1]])
	operation_b = ((2, seq_length), [0] * (seq_length - 2) + [seq[-1] * (seq_length - 1)])
	operation_c = ((1, seq_length), [-x * seq_length for x in seq])
	result = (operation_a, operation_b, operation_c)
	return result
main()


def convert(lst):
	return ' '.join(lst)
arr_size = int(input())
arr = list(map(int, input().split()))
print('1 1')
print(-arr[0])
arr[0] = 0
if arr_size > 1:
	print('2 ' + str(arr_size))
	to_add_list = [i * (arr_size - 1) for i in arr]
	to_add_list = [str(i) for i in to_add_list]
	print(convert(to_add_list[-(arr_size - 1):]))
	arr = [i * arr_size for i in arr]
	print('1 ' + str(arr_size))
	to_add_list = [i * -1 for i in arr]
	to_add_list = [str(i) for i in to_add_list]
	print(convert(to_add_list))
else:
	print('1 1')
	print(0)
	print('1 1')
	print(0)


n = int(input())
l = list(map(int, input().split()))
print('1 1')
print(-1 * l[0])
if n > 1:
	print('2 ' + str(n))
	ans = [i * (n - 1) for i in l[1:-1]]
	for i in ans:
		print(i, end=' ')
	print(l[-1] * (n - 1))
	print('1 ' + str(n))
	l[0] = 0
	ans = [-1 * i * n for i in l[:-1]]
	for i in ans:
		print(i, end=' ')
	print(-n * l[-1])
else:
	print('1 1\n0\n1 1\n0')


def mullength(n, a):
	print(1, 1)
	print(-a[0])
	a[0] = 0
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	else:
		change = []
		for i in range(1, n):
			change.append((n - 1) * (a[i] % n))
			a[i] += change[i - 1]
		print(2, n)
		print(*change)
		print(1, n)
		for i in a:
			print(-i, end=' ')
res = []
n = int(input())
par = list(map(int, input().split()))
mullength(n, par)


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print('1 1')
	print('0')
	print('1 1')
	print('0')
	print('1 1')
	print(-a[0])
else:
	print('1', n - 1)
	b = []
	for i in range(n - 1):
		x = a[i] % n
		y = x * (n - 1)
		b.append(y)
		a[i] = -(y + a[i])
	print(*b)
	print(n, n)
	print(-a[n - 1])
	a[n - 1] = 0
	print('1', n)
	print(*a)


import sys
input = sys.stdin.readline
n = int(input())
A = list(map(int, input().split()))
ANS0 = []
ANS1 = []
if n == 1:
	print(1, 1)
	print(1)
	print(1, 1)
	print(1)
	print(1, 1)
	print(-A[0] - 2)
else:
	nm = n - 1
	for i in range(nm):
		ANS0.append(nm * (A[i] % n))
	for i in range(nm):
		ANS1.append(-(A[i] + ANS0[i]))
	ANS1.append(0)
	print(1, nm)
	print(*ANS0)
	print(1, n)
	print(*ANS1)
	print(n, n)
	print(-A[nm])


from sys import stdin, stdout
input = stdin.readline
n = int(input())
(*a,) = map(int, input().split())
print(1, 1)
print(-a[0])
a[0] = 0
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
print(1, n)
for x in a:
	print(-(x % (n - 1)) * n, end=' ')
print()
print(2, n)
for x in a[1:]:
	print(-(x // (n - 1) - x % (n - 1)) * (n - 1), end=' ')


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inara():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
n = inp()
a = inara()
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit(0)
print(1, 1)
print(-a[0])
print(1, n)
for i in range(n):
	if i == 0:
		print(0, end=' ')
	else:
		print(-n * a[i], end=' ')
print()
print(2, n)
for i in range(1, n):
	print((n - 1) * a[i], end=' ')


n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-l[0])
else:
	print(1, 1)
	print(-l[0])
	l[0] = 0
	print(2, n)
	valarr = []
	for i in range(1, n):
		temp = n - 1
		val = l[i] % n * temp
		l[i] += val
		valarr.append(val)
	print(*valarr)
	print(1, n)
	arr = []
	for i in range(n):
		arr.append(-l[i])
	print(*arr)


n = int(input())
s = input()
s = s.split()
arr = []
for i in s:
	arr.append(int(i))
if n == 1:
	print(1, 1)
	print(1)
	arr[0] += 1
	print(1, 1)
	print(1)
	arr[0] += 1
	print(1, 1)
	x = -1 * arr[0]
	print(x)
	exit(0)
print(1, n - 1)
for i in range(n - 1):
	x = arr[i] % n
	x = x * (n - 1)
	arr[i] += x
	print(x, end=' ')
print()
print(n, n)
x = arr[n - 1] % n
x = n - x
print(x)
arr[n - 1] += x
print(1, n)
for i in arr:
	x = -1 * i
	print(x, end=' ')


n = int(input())
a = [int(i) for i in input().split()]
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
elif n == 2:
	print(1, 1)
	print(-a[0])
	print(2, 2)
	print(-a[1])
	print(2, 2)
	print(0)
else:
	print(1, 1)
	print(-a[0])
	print(2, n)
	b = [a[i] * (n - 1) for i in range(1, n)]
	print(*b, sep=' ')
	print(1, n)
	b = [0]
	for i in range(1, n):
		b.append(-n * a[i])
	print(*b, sep=' ')


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	exit()
print(1, 1)
print(-a[0])
a[0] = 0
l = [0] * n
for i in range(1, n):
	m = a[i] % n
	l[i] = (n - 1) * m
	a[i] += l[i]
print(2, n)
print(*l[1:])
print(1, n)
print(*[-a[i] for i in range(n)])


n = int(input())
a = [*map(int, input().split())]
if n == 1:
	print('1 1')
	print('0')
	print('1 1')
	print('0')
	print('1 1')
	print(-a[0])
	exit(0)
print(1, 1)
print(-a[0])
print(1, n)
count = 0
for i in a:
	if count == 0:
		print(0, end=' ')
		count += 1
		continue
	print(-i * n, end=' ')
print()
print(2, n)
count = 0
for i in a:
	if count == 0:
		count += 1
		continue
	print(i * (n - 1), end=' ')


import sys
import math
import bisect
from sys import stdin, stdout
from math import gcd, floor, sqrt, log2, ceil, pi, sin, cos, acos, atan
from collections import defaultdict as dd
from bisect import bisect_left as bl, bisect_right as br
from bisect import insort
from collections import Counter
from collections import deque
from heapq import heappush, heappop, heapify
from itertools import permutations, combinations
mod = int(1000000000.0) + 7
ip = lambda : int(stdin.readline())
inp = lambda : map(int, stdin.readline().split())
ips = lambda : stdin.readline().rstrip()
out = lambda x: stdout.write(str(x) + '\n')
t = 1
for _ in range(t):
	n = ip()
	arr = list(inp())
	test = list(arr)
	if n == 1:
		print(1, 1)
		print(-arr[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
	else:
		print(1, 1)
		print(-arr[0])
		print(1, n)
		arr[0] = 0
		sam = [-n * i for i in arr]
		print(*sam)
		print(2, n)
		sam = []
		for i in range(1, n):
			sam.append((n - 1) * arr[i])
		print(*sam)


from sys import stdin, stdout
nmbr = lambda : int(stdin.readline())
lst = lambda : list(map(int, stdin.readline().split()))
for _ in range(1):
	n = nmbr()
	a = lst()
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		continue
	print(1, n)
	for i in range(n):
		stdout.write(str(-n * a[i]) + ' ')
	print()
	print(1, n - 1)
	for i in range(n - 1):
		stdout.write(str((n - 1) * a[i]) + ' ')
	print()
	print(n, n)
	print(a[-1] * (n - 1))


n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print('1 1')
	print(-l[0])
	print('1 1')
	print('0')
	print('1 1')
	print('0')
else:
	print('1 1')
	print(-l[0])
	print('2', n)
	ll = []
	ans = [0]
	for i in range(1, n):
		ll.append((n - 1) * l[i])
		ans.append(-n * l[i])
	print(*ll)
	print('1', n)
	print(*ans)


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inlst():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
_ = inp()
lst = inlst()
n = len(lst)
print('{} {}'.format(1, 1))
print('{}'.format(-lst[0]))
if n > 1:
	lst[0] = 0
	print('{} {}'.format(2, n))
	for e in lst[1:n]:
		print((n - 1) * e, end=' ')
	print('')
	print('{} {}'.format(1, n))
	for e in lst[0:n]:
		print(-e * n, end=' ')
	print('')
else:
	print('{} {}'.format(1, 1))
	print(0)
	print('{} {}'.format(1, 1))
	print(0)


n = int(input())
l = list(map(int, input().split()))
r = []
if n == 1:
	print(1, 1)
	print(-l[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	for i in l:
		r.append(n - i % n)
	ans = []
	print(1, n - 1)
	for i in range(n - 1):
		if l[i] >= 0:
			ans.append(-(l[i] + (n - 1) * (n - r[i])))
			print((n - 1) * (n - r[i]), end=' ')
		else:
			ans.append(-(l[i] + (n - 1) * (n - r[i])))
			print((n - 1) * (n - r[i]), end=' ')
	print()
	print(n, n)
	print(-l[n - 1])
	print(1, n)
	ans.append(0)
	print(*ans)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e):
	return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1):
	return int(-(-x // y))

def Yes():
	print('Yes')

def No():
	print('No')

def YES():
	print('YES')

def NO():
	print('NO')
INF = 10 ** 18
MOD = 10 ** 9 + 7
from math import floor
Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
n = int(ri())
a = Ri()
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	ans = []
	na = [0] * n
	na[0] = 0
	g = (n - 1) * n
	ans.append((1, 1))
	ans.append([-a[0]])
	ans.append((2, n))
	temp = []
	for i in range(1, n):
		rem = a[i] % n
		rem = n - rem
		na[i] = a[i] + (n - 1) * (n - rem)
		temp.append(na[i] - a[i])
	ans.append(temp)
	ans.append((1, n))
	temp = []
	for i in range(0, n):
		temp.append(-na[i])
	ans.append(temp)
	for i in ans:
		print(*i)


n = int(input())
a = [int(x) for x in input().split()]
n = len(a)
if n == 1:
	print('1 1\n0\n1 1\n0\n1 1\n{}'.format(-a[0]))
else:
	print('1 1\n{}'.format(a[0] * (n - 1)))
	print('2 {}'.format(n))
	b = []
	for i in range(1, n):
		b.append(a[i] * (n - 1))
	print(' '.join([str(x) for x in b]))
	print('1 {}'.format(n))
	print(' '.join([str(-x * n) for x in a]))


from math import ceil
n = int(input())
a = list(map(int, input().split()))
print(1, n)
for i in range(0, n):
	d = a[i] * n
	a[i] -= a[i] * n
	print(-d, end=' ')
print('')
if n == 1:
	print(1, 1)
	print(0)
else:
	print(1, n - 1)
	for i in range(0, n - 1):
		print(-a[i], end=' ')
print('')
print(n, n)
print(-a[-1])


import sys
input = sys.stdin.buffer.readline
n = int(input())
arr = [int(c) for c in input().split()]
if n == 1:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n - 1)
	ans = []
	for i in range(n - 1):
		if arr[i] % n == 0:
			ans.append(0)
		else:
			j = arr[i] % n
			an = j * (n - 1)
			ans.append(an)
			arr[i] = arr[i] + an
	print(*ans)
	print(n, n)
	print(-1 * arr[-1])
	arr[-1] = 0
	print(1, n)
	ans = []
	for i in arr:
		k = i // n
		ans.append(-1 * k * n)
	print(*ans)


import sys
input = sys.stdin.readline

def ceil(x):
	if x != int(x):
		x = int(x) + 1
	return x

def factorial(x, m):
	val = 1
	while x > 0:
		val = val * x % m
		x -= 1
	return val

def fact(x):
	val = 1
	while x > 0:
		val *= x
		x -= 1
	return val

def swaparr(arr, a, b):
	temp = arr[a]
	arr[a] = arr[b]
	arr[b] = temp

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	return a * b // gcd(a, b)

def nCr(n, k):
	if k > n:
		return 0
	if k > n - k:
		k = n - k
	res = 1
	for i in range(k):
		res = res * (n - i)
		res = res / (i + 1)
	return int(res)

def upper_bound(a, x, lo=0, hi=None):
	if hi == None:
		hi = len(a)
	while lo < hi:
		mid = (lo + hi) // 2
		if a[mid] < x:
			lo = mid + 1
		else:
			hi = mid
	return lo

def primefs(n):
	primes = {}
	while n % 2 == 0 and n > 0:
		primes[2] = primes.get(2, 0) + 1
		n = n // 2
	for i in range(3, int(n ** 0.5) + 2, 2):
		while n % i == 0 and n > 0:
			primes[i] = primes.get(i, 0) + 1
			n = n // i
	if n > 2:
		primes[n] = primes.get(n, 0) + 1
	return primes

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def find(x, link):
	p = x
	while p != link[p]:
		p = link[p]
	while x != p:
		nex = link[x]
		link[x] = p
		x = nex
	return p

def union(x, y, link, size):
	x = find(x, link)
	y = find(y, link)
	if size[x] < size[y]:
		(x, y) = swap(x, y)
	if x != y:
		size[x] += size[y]
		link[y] = x

def sieve(n):
	prime = [True for i in range(n + 1)]
	(prime[0], prime[1]) = (False, False)
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime
MAXN = int(100000.0 + 5)

def spf_sieve():
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, ceil(MAXN ** 0.5), 2):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i
spf = [0 for i in range(MAXN)]

def factoriazation(x):
	res = []
	for i in range(2, int(x ** 0.5) + 1):
		while x % i == 0:
			res.append(i)
			x //= i
	if x != 1:
		res.append(x)
	return res

def int_array():
	return list(map(int, input().strip().split()))

def float_array():
	return list(map(float, input().strip().split()))

def str_array():
	return input().strip().split()
MOD = int(1000000000.0) + 7
CMOD = 998244353
INF = float('inf')
NINF = -float('inf')
from itertools import permutations
import math
from bisect import bisect_left

def solve():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	print(1, n - 1)
	for i in range(n - 1):
		print(a[i] * (n - 1), end=' ')
		a[i] += a[i] * (n - 1)
	print()
	print(1, n)
	for i in range(n):
		print(-n * (a[i] // n), end=' ')
		a[i] -= n * (a[i] // n)
	print()
	print(n, n)
	print(-a[-1])
for _ in range(1):
	solve()


def sieve(x):
	primes = [True] * (x + 1)
	d = 2
	while d * d <= x:
		if primes[d]:
			for p in range(d * d, len(primes), d):
				primes[p] = False
		d += 1
	return primes

def ext_euclid(a, b, c):
	(a1, b1, a2, b2) = (1, 0, 0, 1)
	while b != 0:
		(a, b, a1, b1, a2, b2) = (b, a % b, a2, b2, a1 - a2 * (a // b), b1 - b2 * (a // b))
	return a1

def find_pr(x, primes):
	if x == 2:
		return 1
	for ans in range(x // 2 + 1, x + 1):
		if primes[ans]:
			return ans
	raise Exception(ValueError)
N = int(input())
x = list(map(int, input().split()))
primes = sieve(N + 1)
part_sz = find_pr(len(x), primes)
LR = [(1, part_sz), (N - part_sz + 1, N)]
for (L, R) in LR:
	print(L, R)
	ans = []
	for i in range(L - 1, R):
		if x[i] % N == 0:
			ans.append(0)
		else:
			delta = ext_euclid(part_sz, N, 1) * (x[i] % N) * (R - L + 1)
			ans.append(-delta)
			x[i] -= delta
	print(*ans)
print(1, N)
print(*[-t for t in x])


import sys
input = sys.stdin.readline
N = int(input())
A = [int(_) for _ in input().split()]
if N == 1:
	print(1, 1)
	print(-A[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, N - 1)
	R = [(N - 1) * (A[i] % N) for i in range(N - 1)]
	for el in R:
		assert el % (N - 1) == 0
	B = [A[i] + R[i] for i in range(N - 1)]
	print(' '.join(map(str, R)))
	print(N, N)
	print(-A[N - 1])
	B.append(0)
	print(1, N)
	for el in B:
		assert el % N == 0
	print(' '.join(map(str, [-el for el in B])))


import io
import os
import sys
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

def printd(*args, **kwargs):
	pass

def get_str():
	return input().decode().strip()

def rint():
	return map(int, input().split())

def oint():
	return int(input())
n = oint()
a = list(rint())
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])
	exit()
x = []
b = []
for i in range(n - 1):
	x.append(a[i] + n)
	b.append((n - 1) * x[-1])
x.append(n - a[n - 1])
b.append(x[n - 1])
print(1, n - 1)
print(*b[:n - 1])
print(n, n)
print(b[-1])
printd('a', a)
printd('b', b)
for i in range(n):
	a[i] += b[i]
printd('a', a)
b = []
for i in range(n):
	b.append(-a[i])
print(1, n)
print(*b)


import sys
input = sys.stdin.readline
n = int(input())
a = [int(x) for x in input().strip().split()]
if n == 1:
	print('1 1\n{}\n1 1\n0\n1 1\n0'.format(-a[0]))
else:
	print(1, 1)
	print(-a[0])
	print(1, n)
	print(' '.join(map(str, [0] + [-n * x for x in a[1:]])))
	print(2, n)
	print(' '.join((str((n - 1) * x) for x in a[1:])))


n = int(input())
arr = list(map(int, input().strip().split()))[:n]
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-arr[0])
	exit(0)
print(1, 1)
print(-arr[0])
arr[0] = 0
print(2, n)
for i in range(1, n):
	val = arr[i] % n * (n - 1)
	print(val, end=' ')
	arr[i] += val
print()
print(1, n)
for i in range(n):
	print(-arr[i], end=' ')
print()


def solve():
	n = int(input())
	arr = list(map(int, input().split()))
	if n == 1:
		print(1, 1)
		print(-arr[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	(l1, r1) = (1, n - 1)
	ans1 = [0] * (n - 1)
	for i in range(n - 1):
		ans1[i] = arr[i] * (n - 1)
	(l2, r2) = (2, n)
	ans2 = [0] * (n - 2) + [arr[-1] * (n - 1)]
	ans3 = [0] * n
	for i in range(n):
		ans3[i] = arr[i] * n * -1
	print(l1, r1)
	print(*ans1)
	print(l2, r2)
	print(*ans2)
	print(1, n)
	print(*ans3)

def main():
	solve()
main()


from math import *
n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(l[0])
	print(1, 1)
	print(-l[0])
	print(1, 1)
	print(-l[0])
else:
	print(1, n - 1)
	for i in range(n - 1):
		print(l[i] * (n - 1), end=' ')
	print()
	print(n, n)
	print(l[n - 1] * (n - 1))
	print(1, n)
	for i in range(n):
		print(-l[i] * n, end=' ')
	print()


n = int(input())
arr = [int(x) for x in input().split()]
if n == 1:
	print(1, 1)
	print(-arr[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(n - arr[0])
	arr[0] = n
	print(2, n)
	for i in range(1, n):
		print(arr[i] % n * (n - 1), end=' ')
		arr[i] += arr[i] % n * (n - 1)
		assert abs(arr[i]) % n == 0
	print()
	print(1, n)
	print(*[-x for x in arr])


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-a[0])
	print(2, n)
	b = []
	c = []
	m = n - 1
	for i in range(1, n):
		j = 1
		b.append(a[i] * m)
		c.append(-a[i] * n)
	print(*b)
	print(1, n)
	print(0, *c)


import math
import collections
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect_left as bsl
from bisect import bisect_right as bsr
import heapq as hq
setrecursionlimit(2 ** 20)
t = 1
for _ in range(t):
	n = int(stdin.readline())
	a = list(map(int, stdin.readline().rstrip().split()))
	if n > 1:
		print(1, n - 1)
		for i in range(n - 1):
			print((n - 1) * a[i], end=' ')
		print()
		print(n, n)
		print(-a[-1])
		print(1, n)
		for i in range(n - 1):
			print(-n * a[i], end=' ')
		print(0)
	else:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)


n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-l[0])
else:
	print(1, n)
	arr = []
	for i in range(n):
		arr.append(-l[i] * n)
	print(*arr)
	arr2 = []
	print(1, n - 1)
	for i in range(n - 1):
		arr2.append(l[i] * (n - 1))
	print(*arr2)
	print(n, n)
	print(l[-1] * (n - 1))


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
mod2 = 998244353
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI():
	return [list(map(int, l.split())) for l in sys.stdin.readlines()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def pe(s):
	return print(str(s), file=sys.stderr)

def JA(a, sep):
	return sep.join(map(str, a))

def JAA(a, s, t):
	return s.join((t.join(map(str, b)) for b in a))

def IF(c, t, f):
	return t if c else f

def YES(c):
	return IF(c, 'YES', 'NO')

def Yes(c):
	return IF(c, 'Yes', 'No')

def main():
	t = 1
	rr = []
	for _ in range(t):
		n = I()
		a = LI()
		if n == 1:
			rr.append('1 1')
			rr.append(-a[0])
			rr.append('1 1')
			rr.append(0)
			rr.append('1 1')
			rr.append(0)
			continue
		rr.append('1 1')
		rr.append(-a[0])
		l = n - 1
		rr.append(JA([1, n], ' '))
		r = [0]
		for i in range(1, n):
			c = a[i]
			m = c % l
			t = -m * n
			r.append(t)
			a[i] += t
		rr.append(JA(r, ' '))
		rr.append(JA([2, n], ' '))
		r = []
		for i in range(1, n):
			r.append(-a[i])
		rr.append(JA(r, ' '))
	return JA(rr, '\n')
print(main())


from sys import stdin, stdout

def update(l, b, a):
	for i in range(len(b)):
		a[i + l - 1] += b[i]

def disp(l, r, b):
	stdout.write('{0} {1}\n'.format(l, r))
	stdout.write(' '.join([str(i) for i in b]))
	stdout.write('\n')

def main():
	n = int(stdin.readline())
	a = [int(i) for i in stdin.readline().split()]
	if n != 1:
		(l, r) = (1, 1)
		b = [0] * (r - l + 1)
		b[0] = n - a[0]
		update(l, b, a)
		disp(l, r, b)
		(l, r) = (2, n)
		b = [0] * (r - l + 1)
		length = n - 1
		for i in range(l - 1, r):
			v = a[i] % n
			v2 = length * v
			b[i - l + 1] = v2
		update(l, b, a)
		disp(l, r, b)
		(l, r) = (1, n)
		b = [0] * (r - l + 1)
		for i in range(n):
			b[i] = -a[i]
		update(l, b, a)
		disp(l, r, b)
	else:
		(l, r) = (1, 1)
		b = [-a[0]]
		update(l, b, a)
		disp(l, r, b)
		b = [0]
		update(l, b, a)
		disp(l, r, b)
		b = [0]
		update(l, b, a)
		disp(l, r, b)
main()


import sys
input = sys.stdin.readline
n = int(input())
a = [int(x) for x in input().split()]
if n == 1:
	print(1, 1, sep=' ')
	print(a[0])
	print(1, 1, sep=' ')
	print(a[0])
	print(1, 1, sep=' ')
	print(-a[0] * 3)
	exit()
print(1, n - 1, sep=' ', end='\n')
for i in range(n - 1):
	k = a[i] * (n - 1)
	a[i] += a[i] * (n - 1)
	print(k, end=' ')
print('')
print(2, n, sep=' ')
for i in range(1, n):
	k = 0
	if i == n - 1:
		k = a[i] * (n - 1)
		a[i] += a[i] * (n - 1)
	print(k, end=' ')
print('')
print(1, n, sep=' ')
for i in range(n):
	print(-a[i], end=' ')


import sys
from collections import defaultdict as dd
from collections import deque
from functools import *
from fractions import Fraction as f
from copy import *
from bisect import *
from heapq import *
from math import *
from itertools import permutations, product

def eprint(*args):
	print(*args, file=sys.stderr)
zz = 1
if zz:
	input = sys.stdin.readline
else:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('all.txt', 'w')

def inc(d, c):
	d[c] = d[c] + 1 if c in d else 1

def bo(i):
	return ord(i) - ord('A')

def li():
	return [int(xx) for xx in input().split()]

def fli():
	return [float(x) for x in input().split()]

def comp(a, b):
	if a > b:
		return 2
	return 2 if a == b else 0

def gi():
	return [xx for xx in input().split()]

def fi():
	return int(input())

def pro(a):
	return reduce(lambda a, b: a * b, a)

def swap(a, i, j):
	(a[i], a[j]) = (a[j], a[i])

def si():
	return list(input().rstrip())

def mi():
	return map(int, input().split())

def gh():
	sys.stdout.flush()

def isvalid(i, j):
	return 0 <= i < n and 0 <= j < n

def bo(i):
	return ord(i) - ord('a')

def graph(n, m):
	for i in range(m):
		(x, y) = mi()
		a[x].append(y)
		a[y].append(x)
t = 1
while t > 0:
	t -= 1
	n = fi()
	a = li()
	v = []
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		print(1, 1)
		print(-a[0])
		continue
	for i in range(n):
		p = n - 1 - a[i] % (n - 1)
		a[i] += n * p
		v.append(n * p)
	print(1, n)
	print(*v)
	print(n, n)
	print(-a[-1])
	print(1, n - 1)
	for i in range(n - 1):
		print(-a[i], end=' ')


import math, sys, bisect, heapq
from collections import defaultdict, Counter, deque
from itertools import groupby, accumulate
from functools import lru_cache
from heapq import heapify, heappop, heappush
int1 = lambda x: int(x) - 1
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
aj = lambda : list(map(int, input().split()))

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def Y(c):
	print(['NO', 'YES'][c])

def y(c):
	print(['no', 'yes'][c])

def Yy(c):
	print(['No', 'Yes'][c])
(n,) = aj()
A = aj()
if n == 1:
	print('1 1')
	print(0)
	print('1 1')
	print(0)
	print('1 1')
	print(-A[0])
else:
	print('1 1')
	print(-A[0])
	A[0] = 0
	print('2', n)
	for (ii, i) in enumerate(A):
		if ii != 0:
			print(i * (n - 1), end=' ')
			A[ii] += i * (n - 1)
	print()
	print(1, n)
	for i in A:
		print(-i, end=' ')
	print()


n = int(input())
a = [int(i) for i in input().split()]
print('1 1')
print(-a[0])
a[0] = 0
if n == 1:
	print('1 1\n0\n1 1\n0')
else:
	print(1, n)
	print(' '.join([str(-n * i) for i in a]))
	print(2, n)
	print(' '.join([str((n - 1) * i) for i in a[1:]]))


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
	print(1, 1)
	print(-a[0])
	exit()
print(1, n)
add_numbers = [-n * a[i] % (n * n - n) for i in range(n)]
print(*add_numbers)
print(1, n - 1)
sec_add_numbers = [-a[i] - add_numbers[i] for i in range(n - 1)]
print(*sec_add_numbers)
print(n, n)
print(-a[n - 1] - add_numbers[n - 1])


from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush, heappop, heapify
import math
from collections import *
from functools import reduce, cmp_to_key
import sys
input = sys.stdin.readline
from itertools import accumulate
from functools import lru_cache
M = mod = 998244353

def factors(n):
	return sorted(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0))))

def inv_mod(n):
	return pow(n, mod - 2, mod)

def li():
	return [int(i) for i in input().rstrip('\n').split()]

def st():
	return input().rstrip('\n')

def val():
	return int(input().rstrip('\n'))

def li2():
	return [i for i in input().rstrip('\n')]

def li3():
	return [int(i) for i in input().rstrip('\n')]
n = val()
l = li()
if n == 1:
	print(1, 1)
	print(-l[0])
	print(1, 1)
	print(-1)
	print(1, 1)
	print(1)
else:
	print(1, n)
	l1 = []
	for i in range(n - 1):
		x = l[i] % (n - 1)
		t = (n - 1 - x) % (n - 1)
		l1.append(n * t)
		l[i] += l1[i]
	l1.append(0)
	print(*l1)
	print(1, n - 1)
	l1 = []
	for i in range(n - 1):
		l1.append(-l[i])
	print(*l1)
	print(n, n)
	print(-l[-1])


import math
from sys import stdin
g = lambda : stdin.readline().strip()
gl = lambda : g().split()
gil = lambda : [int(var) for var in gl()]
gfl = lambda : [float(var) for var in gl()]
gcl = lambda : list(g())
gbs = lambda : [int(var) for var in g()]
mod = int(1000000000.0) + 7
inf = float('inf')
(n,) = gil()
a = gil()
if n == 1:
	v = a[0] + 2
	print(1, 1)
	print(1)
	print(1, 1)
	print(1)
	print(1, 1)
	print(-v)
else:
	print(n, n)
	print(-a[-1])
	a[-1] = 0
	print(1, n - 1)
	for i in range(n - 1):
		md = a[i] % n
		if md:
			cmd = n - md
			val = (n - cmd) * (n - 1)
			a[i] += val
			print(val, end=' ')
		else:
			print(0, end=' ')
	print()
	print(1, n)
	for val in a:
		print(-val, end=' ')
	print()


from bisect import bisect_left
n = int(input())
l = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-1 * l[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n)
	x = n - 1
	for i in range(n):
		t = l[i]
		if l[i] % x:
			l[i] += (x + 1) * (x - t % x)
		print(l[i] - t, end=' ')
	x = x - 1
	print()
	print(2, n)
	for i in range(1, n):
		print(-1 * l[i], end=' ')
	print()
	print(1, 1)
	print(-1 * l[0])


import sys
readline = sys.stdin.readline
N = int(readline())
A = list(map(int, readline().split()))
if N == 1:
	print(1, 1)
	print(-A[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, N)
	L1 = [0] + [-a * N for a in A[1:]]
	print(*L1)
	print(2, N)
	L2 = [a * (N - 1) for a in A[1:]]
	print(*L2)
	print(1, 1)
	print(-A[0])


import sys
inp = sys.stdin.buffer.readline
inar = lambda : list(map(int, inp().split()))
inin = lambda : int(inp())
inst = lambda : inp().decode().strip()
_T_ = 1
for _t_ in range(_T_):
	n = inin()
	a = inar()
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		break
	print(n, n)
	print(-a[-1])
	a[-1] -= a[-1]
	print(1, n - 1)
	for i in range(n - 1):
		print(a[i] * (n - 1), end=' ')
		a[i] += a[i] * (n - 1)
	print()
	print(1, n)
	for i in range(n):
		print(-a[i], end=' ')
		a[i] -= a[i]
	print()


import os
import sys
from io import BytesIO, IOBase
import threading
from collections import defaultdict, Counter, deque
from math import factorial as fac

def main():
	n = int(input())
	arr = list(map(int, input().split()))
	if n == 1:
		print(f'{1} {1}')
		print(-arr[0])
		print(f'{1} {1}')
		print(0)
		print(f'{1} {1}')
		print(0)
	else:
		val = []
		print(f'{1} {n}')
		for i in range(n):
			val.append(n * arr[i] * -1)
		print(*val, sep=' ')
		val.clear()
		print(f'{1} {n - 1}')
		for i in range(n - 1):
			val.append((n - 1) * arr[i])
		print(*val, sep=' ')
		print(f'{n} {n}')
		print((n - 1) * arr[n - 1])
main()


n = int(input())
a = [int(i) for i in input().split()]
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, 1)
	print(-a[0])
	print(1, n)
	a = a[1:]
	print(0, *[-n * a_i for a_i in a])
	print(2, n)
	print(*[(n - 1) * a_i for a_i in a])


import sys
input = sys.stdin.readline
n = int(input())
a = [int(i) for i in input().split()]
if n == 1:
	print(1, 1)
	print(-a[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	rem = []
	for i in range(n - 1, 0, -1):
		rem.append((n - 1) * i)
	rem.insert(0, 0)
	rem += rem
	print(1, n - 1)
	for i in range(n - 1):
		(mod, div) = (a[i] % (n - 1), a[i] // (n - 1))
		print(rem[(n - mod + div) % n], end=' ')
		a[i] += rem[(n - mod + div) % n]
	print()
	print(1, n)
	for i in range(n):
		if i != n - 1:
			print(-a[i], end=' ')
			a[i] += -a[i]
		else:
			print(2 * n, end=' ')
			a[i] += 2 * n
	print()
	print(n, n)
	print(-a[-1])


from bisect import *
from collections import *
from math import gcd, ceil, sqrt, floor, inf
from heapq import *
from itertools import *
from operator import add, mul, sub, xor, truediv, floordiv
from functools import *
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def RL():
	return map(int, sys.stdin.readline().rstrip().split())

def RLL():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def N():
	return int(input())
from types import GeneratorType

def bootstrap(f, stack=[]):

	def wrappedfunc(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		else:
			to = f(*args, **kwargs)
			while True:
				if type(to) is GeneratorType:
					stack.append(to)
					to = next(to)
				else:
					stack.pop()
					if not stack:
						break
					to = stack[-1].send(to)
			return to
	return wrappedfunc
farr = [1]
ifa = []

def fact(x, mod=0):
	if mod:
		while x >= len(farr):
			farr.append(farr[-1] * len(farr) % mod)
	else:
		while x >= len(farr):
			farr.append(farr[-1] * len(farr))
	return farr[x]

def ifact(x, mod):
	global ifa
	ifa.append(pow(farr[-1], mod - 2, mod))
	for i in range(x, 0, -1):
		ifa.append(ifa[-1] * i % mod)
	ifa = ifa[::-1]

def per(i, j, mod=0):
	if i < j:
		return 0
	if not mod:
		return fact(i) // fact(i - j)
	return farr[i] * ifa[i - j] % mod

def com(i, j, mod=0):
	if i < j:
		return 0
	if not mod:
		return per(i, j) // fact(j)
	return per(i, j, mod) * ifa[j] % mod

def catalan(n):
	return com(2 * n, n) // (n + 1)

def linc(f, t, l, r):
	while l < r:
		mid = (l + r) // 2
		if t > f(mid):
			l = mid + 1
		else:
			r = mid
	return l

def rinc(f, t, l, r):
	while l < r:
		mid = (l + r + 1) // 2
		if t < f(mid):
			r = mid - 1
		else:
			l = mid
	return l

def ldec(f, t, l, r):
	while l < r:
		mid = (l + r) // 2
		if t < f(mid):
			l = mid + 1
		else:
			r = mid
	return l

def rdec(f, t, l, r):
	while l < r:
		mid = (l + r + 1) // 2
		if t > f(mid):
			r = mid - 1
		else:
			l = mid
	return l

def isprime(n):
	for i in range(2, int(n ** 0.5) + 1):
		if n % i == 0:
			return False
	return True

def binfun(x):
	c = 0
	for w in arr:
		c += ceil(w / x)
	return c

def lowbit(n):
	return n & -n

def inverse(a, m):
	a %= m
	if a <= 1:
		return a
	return (1 - inverse(m, a) * m) // a % m

class BIT:

	def __init__(self, arr):
		self.arr = arr
		self.n = len(arr) - 1

	def update(self, x, v):
		while x <= self.n:
			self.arr[x] += v
			x += x & -x

	def query(self, x):
		ans = 0
		while x:
			ans += self.arr[x]
			x &= x - 1
		return ans

class DSU:

	def __init__(self, n):
		self.c = [-1] * n

	def same(self, x, y):
		return self.find(x) == self.find(y)

	def find(self, x):
		if self.c[x] < 0:
			return x
		self.c[x] = self.find(self.c[x])
		return self.c[x]

	def union(self, u, v):
		(u, v) = (self.find(u), self.find(v))
		if u == v:
			return False
		if self.c[u] < self.c[v]:
			(u, v) = (v, u)
		self.c[u] += self.c[v]
		self.c[v] = u
		return True

	def size(self, x):
		return -self.c[self.find(x)]

class UFS:

	def __init__(self, n):
		self.parent = [i for i in range(n)]
		self.ranks = [0] * n

	def find(self, x):
		if x != self.parent[x]:
			self.parent[x] = self.find(self.parent[x])
		return self.parent[x]

	def union(self, u, v):
		(pu, pv) = (self.find(u), self.find(v))
		if pu == pv:
			return False
		if self.ranks[pu] >= self.ranks[pv]:
			self.parent[pv] = pu
			if self.ranks[pv] == self.ranks[pu]:
				self.ranks[pu] += 1
		else:
			self.parent[pu] = pv

def Prime(n):
	c = 0
	prime = []
	flag = [0] * (n + 1)
	for i in range(2, n + 1):
		if not flag[i]:
			prime.append(i)
			c += 1
		for j in range(c):
			if i * prime[j] > n:
				break
			flag[i * prime[j]] = prime[j]
			if i % prime[j] == 0:
				break
	return prime

def dij(s, graph):
	d = {}
	d[s] = 0
	heap = [(0, s)]
	seen = set()
	while heap:
		(dis, u) = heappop(heap)
		if u in seen:
			continue
		for v in graph[u]:
			if v not in d or d[v] > d[u] + graph[u][v]:
				d[v] = d[u] + graph[u][v]
				heappush(heap, (d[v], v))
	return d

def GP(it):
	return [(ch, len(list(g))) for (ch, g) in groupby(it)]

class DLN:

	def __init__(self, val):
		self.val = val
		self.pre = None
		self.next = None
t = 1
for i in range(t):
	n = N()
	a = RLL()
	print(1, 1)
	print(-a[0])
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		exit()
	print(2, n)
	res = []
	for i in range(1, n):
		res.append(a[i] * (n - 1))
	print(*res)
	print(1, n)
	res = [0]
	for i in range(1, n):
		res.append(-a[i] * n)
	print(*res)


import os
import sys
from io import BytesIO, IOBase
import threading
from collections import defaultdict, Counter
import heapq
from math import ceil, floor

def main():
	n = int(input())
	arr = list(map(int, input().split()))
	print(1, 1)
	print(-arr[0])
	if n == 1:
		print(1, 1)
		print(0)
		print(1, 1)
		print(0)
		return
	print(2, n)
	a = []
	for i in range(1, n):
		k = arr[i] % n
		ad = k * (n - 1)
		if arr[i] + ad > 10 ** 18 or arr[i] + ad < -10 ** 18:
			ad = -(n - k) * (n - 1)
		a.append(ad)
		assert ad % (n - 1) == 0
		arr[i] = arr[i] + ad
	print(*a)
	print(1, n)
	a = [0]
	for i in range(1, n):
		assert abs(arr[i]) < 10 ** 18
		assert arr[i] % n == 0
		a.append(-arr[i])
	print(*a)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
for i in range(1):
	main()


import sys
input = sys.stdin.readline

def print(val):
	sys.stdout.write(val + '\n')

def prog():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print('1 1')
		print(f'{-a[0]}')
		print('1 1')
		print('0')
		print('1 1')
		print('0')
		return
	print('1 1')
	print(f'{-a[0]}')
	a[0] = 0
	output = [0] * (n - 1)
	for i in range(1, n):
		added = a[i] % n * (n - 1)
		output[i - 1] = str(added)
		a[i] += added
		a[i] = -a[i]
	print(f'2 {n}')
	print(' '.join(output))
	print(f'1 {n}')
	print(' '.join(map(str, a)))
prog()


n = int(input())
s = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(1)
	print(1, 1)
	print(1)
	print(1, 1)
	print(-s[0] - 2)
	exit()
print(1, n)
for i in s:
	print(-n * i, end=' ')
print()
print(1, n - 1)
for i in s[:n - 1]:
	print(i * (n - 1), end=' ')
print()
print(2, n)
for i in range(2, n):
	print(0, end=' ')
print(s[-1] * (n - 1))
print()


n = int(input())
A = list(map(int, input().split()))
if n == 1:
	print(*[1, 1])
	print(-A[0])
	print(*[1, 1])
	print(0)
	print(*[1, 1])
	print(0)
else:
	print(*[1, 1])
	print(-A[0])
	A[0] = 0
	print(*[2, n])
	l = []
	for i in range(1, n):
		x = A[i] % n * (n - 1)
		A[i] += x
		l.append(x)
	print(*l)
	l1 = [-1 * i for i in A]
	print(*[1, n])
	print(*l1)


n = int(input())
arr = list(map(int, input().split()))
if n == 1:
	print('1 1')
	print('0')
	print('1 1')
	print('0')
	print('1 1')
	print(-arr[0])
else:
	print('1 1')
	print(-arr[0])
	print('2 ' + str(n))
	arr[0] = 0
	req = []
	for i in range(1, n):
		req.append(str((n - 1) * arr[i]))
	s = ' '.join(req)
	print(s)
	print('1 ' + str(n))
	req = []
	s = ''
	for i in range(n):
		req.append(str(-n * arr[i]))
	s = ' '.join(req)
	print(s)


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(a[0] * -1)
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	first = (1, n - 1)
	cop = n - 1
	r1 = []
	for i in range(n - 1):
		if a[i] % n == 0:
			r1.append(0)
		else:
			right = None
			if a[i] < 0:
				right = a[i] * -1
			else:
				r = a[i] % n
				right = (n - r) % n
			num = n - right
			r1.append((n - 1) * num)
			a[i] += (n - 1) * num
	print(*first)
	print(*r1)
	print(n, n)
	print(a[n - 1] * -1)
	a[n - 1] = 0
	print(1, n)
	for i in range(n):
		print(a[i] * -1, end=' ')
	print()


import sys

def answer(n, a):
	if n == 1:
		print(1, 1)
		print(-a[0])
		print(1, 1)
		print(1)
		print(1, 1)
		print(-1)
		return
	print(1, 1)
	ans = []
	ans.append(n - a[0])
	print(n - a[0])
	print(2, n)
	for i in range(1, n):
		ans.append(a[i] % n * (n - 1))
	print(*ans[1:])
	print(1, n)
	ans2 = []
	for i in range(n):
		ans2.append(-(ans[i] + a[i]))
	print(*ans2)
	return

def main():
	n = int(sys.stdin.readline())
	a = list(map(int, sys.stdin.readline().split()))
	answer(n, a)
	return
main()


n = int(input())
s = [int(x) for x in input().split()]
if n == 1:
	print(1, 1)
	print(-s[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	L = [0]
	for i in range(1, len(s)):
		if s[i] % (n - 1) == 0:
			L.append(0)
		else:
			x = s[i] % (n - 1)
			diff = n - 1 - x
			L.append(diff * n)
	kk = []
	for i in range(1, len(s)):
		ele = s[i] + L[i]
		kk.append(-ele)
	print(1, n)
	print(*L)
	print(1, 1)
	print(-s[0])
	print(2, n)
	print(*kk)


from sys import stdin
input = stdin.readline

def li(x):
	return list(map(x, input().split()))

def mp(x):
	return map(x, input().split())

def ip(x):
	return x(input().strip())
for _ in range(1):
	n = ip(int)
	a = li(int)
	if n == 1:
		print(1, 1)
		print(-a[0])
		for i in range(2):
			print(1, 1)
			print(0)
		continue
	print(1, n - 1)
	for i in range(n - 1):
		print(a[i] * (n - 1), end=' ')
	print()
	print(n, n)
	print(-a[-1])
	print(1, n)
	for i in range(n - 1):
		print(-(a[i] * n), end=' ')
	print(0)


t = 1
for _ in range(t):
	n = int(input())
	listi = list(map(int, input().split()))
	print(1, 1)
	print((n - 1) * listi[0])
	if n >= 2:
		print(2, n)
		for i in range(1, n):
			print((n - 1) * listi[i], end=' ')
		print()
	else:
		print(1, 1)
		print(0)
	print(1, n)
	for i in range(n):
		print(-n * listi[i], end=' ')


n = int(input())
a = list(map(int, input().split()))
if n == 1:
	print('1 1', 0, '1 1', 0, '1 1', -a[0], sep='\n')
	exit(0)
print(1, n)
b = []
for i in range(n - 1):
	b.append(-n * (a[i] % (n - 1)))
print(' '.join(map(str, b)), 0)
print(1, n - 1)
print(' '.join((str(-a[i] - b[i]) for i in range(n - 1))))
print(n, n)
print(-a[-1])


import sys, bisect, string, math, time, functools, random, fractions
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
from itertools import permutations, combinations, groupby
rep = range
R = range

def Golf():
	(n, *t) = map(int, open(0).read().split())

def I():
	return int(input())

def S_():
	return input()

def IS():
	return input().split()

def LS():
	return [i for i in input().split()]

def MI():
	return map(int, input().split())

def LI():
	return [int(i) for i in input().split()]

def LI_():
	return [int(i) - 1 for i in input().split()]

def NI(n):
	return [int(input()) for i in range(n)]

def NI_(n):
	return [int(input()) - 1 for i in range(n)]

def NLI(n):
	return [[int(i) for i in input().split()] for i in range(n)]

def NLI_(n):
	return [[int(i) - 1 for i in input().split()] for i in range(n)]

def StoLI():
	return [ord(i) - 97 for i in input()]

def ItoS(n):
	return chr(n + 97)

def LtoS(ls):
	return ''.join([chr(i + 97) for i in ls])

def RA():
	return map(int, open(0).read().split())

def RLI(n=8, a=1, b=10):
	return [random.randint(a, b) for i in range(n)]

def RI(a=1, b=10):
	return random.randint(a, b)

def Rtest(T):
	(case, err) = (0, 0)
	for i in range(T):
		inp = INP()
		(a1, ls) = naive(*inp)
		a2 = solve(*inp)
		if a1 != a2:
			print((a1, a2), inp)
			err += 1
		case += 1
	print('Tested', case, 'case with', err, 'errors')

def GI(V, E, ls=None, Directed=False, index=1):
	org_inp = []
	g = [[] for i in range(V)]
	FromStdin = True if ls == None else False
	for i in range(E):
		if FromStdin:
			inp = LI()
			org_inp.append(inp)
		else:
			inp = ls[i]
		if len(inp) == 2:
			(a, b) = inp
			c = 1
		else:
			(a, b, c) = inp
		if index == 1:
			a -= 1
			b -= 1
		aa = (a, c)
		bb = (b, c)
		g[a].append(bb)
		if not Directed:
			g[b].append(aa)
	return (g, org_inp)

def GGI(h, w, search=None, replacement_of_found='.', mp_def={'#': 1, '.': 0}, boundary=1):
	mp = [boundary] * (w + 2)
	found = {}
	for i in R(h):
		s = input()
		for char in search:
			if char in s:
				found[char] = (i + 1) * (w + 2) + s.index(char) + 1
				mp_def[char] = mp_def[replacement_of_found]
		mp += [boundary] + [mp_def[j] for j in s] + [boundary]
	mp += [boundary] * (w + 2)
	return (h + 2, w + 2, mp, found)

def TI(n):
	return GI(n, n - 1)

def accum(ls):
	rt = [0]
	for i in ls:
		rt += [rt[-1] + i]
	return rt

def bit_combination(n, base=2):
	rt = []
	for tb in R(base ** n):
		s = [tb // base ** bt % base for bt in R(n)]
		rt += [s]
	return rt

def gcd(x, y):
	if y == 0:
		return x
	if x % y == 0:
		return y
	while x % y != 0:
		(x, y) = (y, x % y)
	return y

def YN(x):
	print(['NO', 'YES'][x])

def Yn(x):
	print(['No', 'Yes'][x])

def show(*inp, end='\n'):
	if show_flg:
		print(*inp, end=end)
mo = 10 ** 9 + 7
inf = float('inf')
FourNb = [(-1, 0), (1, 0), (0, 1), (0, -1)]
EightNb = [(-1, 0), (1, 0), (0, 1), (0, -1), (1, 1), (-1, -1), (1, -1), (-1, 1)]
compas = dict(zip('WENS', FourNb))
cursol = dict(zip('LRUD', FourNb))
l_alp = string.ascii_lowercase
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
input = lambda : sys.stdin.readline().rstrip()
show_flg = False
show_flg = True
ans = 0
T = 1
n = I()
a = LI()
if n == 1:
	for i in range(3):
		print(1, 1)
		print(a[0] * (-1) ** (1 + i))
	exit()
c = [n - 1 - i % (n - 1) for i in a]
(x1, x2) = ([], [])
for i in range(n):
	p = c[i]
	x1 += (p * n,)
	a[i] += p * n
for i in range(1, n):
	q = a[i] // (n - 1)
	x2 += (-q * (n - 1),)
	a[i] += -q * (n - 1)
print(1, n)
print(*x1)
print(2, n)
print(*x2)
print(1, 1)
print(-a[0])


n = int(input())
li = list(map(int, input().split()))
if n == 1:
	print(1, 1)
	print(-li[0])
	print(1, 1)
	print(0)
	print(1, 1)
	print(0)
else:
	print(1, n)
	for i in range(n):
		if li[i] >= 0:
			print(n * -li[i], end=' ')
		else:
			print(n * abs(li[i]), end=' ')
	print()
	print(1, n - 1)
	for i in range(n - 1):
		if li[i] >= 0:
			print((n - 1) * li[i], end=' ')
		else:
			print((n - 1) * li[i], end=' ')
	print()
	print(2, n)
	for i in range(1, n):
		if i != n - 1:
			print(0, end=' ')
		elif li[i] >= 0:
			print((n - 1) * li[i], end=' ')
		else:
			print((n - 1) * li[i], end=' ')