Problem: 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 ≤ n ≤ 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, ..., a_n (-10^9 ≤ a_i ≤ 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 ≤ l ≤ r ≤ n): the bounds of the selected segment.

  * The second line contains r-l+1 integers b_l, b_{l+1}, ..., b_r (-10^{18} ≤ b_i ≤ 10^{18}): the numbers to add to a_l, a_{l+1}, …, 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

Solution (in JAVA):

Solution:

import java.io.*;
import java.util.Arrays;
import java.util.InputMismatchException;

/*
By : SSD
*/

public class C {
	long mod = (long) (1e9 + 7);

	static class InputReader1 {

		private final InputStream st;
		private final byte[] buf = new byte[8192];
		private int cc, sc;
		private SpaceCharFilter f;

		public InputReader1(InputStream st) {
			this.st = st;
		}

		public int t() {
			if (sc == -1)
				throw new InputMismatchException();
			if (cc >= sc) {
				cc = 0;
				try {
					sc = st.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (sc <= 0)
					return -1;
			}
			return buf[cc++];
		}

		public int nextInt() {
			int c = t();
			while (isSpaceChar(c)) {
				c = t();
			}
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = t();
			}
			int res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = t();
			} while (!isSpaceChar(c));
			return res * sgn;
		}

		public long nextLong() {
			int c = t();
			while (isSpaceChar(c)) {
				c = t();
			}
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = t();
			}
			long res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = t();
			} while (!isSpaceChar(c));
			return res * sgn;
		}

		public int[] nextIntArray(int n) {
			int a[] = new int[n];
			for (int i = 0; i < n; i++) {
				a[i] = nextInt();
			}
			return a;
		}

		public String readString() {
			int c = t();
			while (isSpaceChar(c)) {
				c = t();
			}
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = t();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		public String nextLine() {
			int c = t();
			while (isSpaceChar(c))
				c = t();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = t();
			} while (!isEndOfLine(c));
			return res.toString();
		}

		public boolean isSpaceChar(int c) {
			if (f != null)
				return f.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		private boolean isEndOfLine(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		public interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}

	class OutputWriter {
		private final PrintWriter writer;

		public OutputWriter(OutputStream outputStream) {
			writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
		}

		public OutputWriter(Writer writer) {
			this.writer = new PrintWriter(writer);
		}

		public void print(Object... objects) {
			for (int i = 0; i < objects.length; i++) {
				if (i != 0) {
					writer.print(' ');
				}
				writer.print(objects[i]);
			}
		}

		public void println(Object... objects) {
			print(objects);
			writer.println();
		}

		public void close() {
			writer.close();
		}
	}

	InputReader1 sc;
	OutputWriter out;

	public static void main(String[] ssd) throws Exception {
		new C().run();
	}

	void run() throws Exception {

		sc = new InputReader1(System.in);

		out = new OutputWriter(System.out);

		long s = System.currentTimeMillis();
		solve();
		tr(System.currentTimeMillis() - s + "ms");
		out.close();

	}

	private void solve() {

		int n = sc.nextInt();
		int[] a = sc.nextIntArray(n);
		if (n == 1) {
			out.println("1 1");
			out.println(-a[0]);
			out.println("1 1");
			out.println(0);
			out.println("1 1");
			out.println(0);
		} else {
			long[] b = new long[n];
			out.println("1 " + (n - 1));
			for (int i = 0; i < n - 1; i++) {
				int m = a[i] % n;
				out.print((long) (n - 1) * m + " ");
				b[i] = a[i] + (long) (n - 1) * m;
			}
			out.println();
			out.println(n + " " + n);
			out.println(-a[n - 1]);
			out.println(1 + " " + n);
			for (int i = 0; i < n; i++) {
				out.print(-b[i] + " ");
			}
			out.println();
		}

	}

	void dbg(Object... o) {
		System.err.println(Arrays.deepToString(o));
	}

	private boolean oj = System.getProperty("ONLINE_JUDGE") != null;

	private void tr(Object... o) {
		if (!oj)
			out.println(Arrays.deepToString(o));
	}
}