#include <bits/stdc++.h>
using namespace std;
long long n;
long long a[100010];
long long ss;
int main(void) {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) scanf("%lld", &a[i]);
  if (n == 1) {
    printf("1 1\n%lld\n1 1\n0\n1 1\n0", a[1] * -1);
    return 0;
  }
  ss = n - 1;
  printf("1 %lld\n", n);
  for (long long i = 1; i < n; i++) {
    long long mo = a[i] % ss;
    if (mo == 0) {
      printf("0 ");
      continue;
    }
    mo = ss - mo;
    a[i] += n * mo;
    printf("%lld ", n * mo);
  }
  printf("0\n1 %lld\n", n - 1);
  for (long long i = 1; i < n; i++) printf("%lld ", a[i] * -1);
  printf("\n%lld %lld\n%lld", n, n, a[n] * -1);
  return 0;
}
