#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
int n;
int a[MAXN], fi[MAXN], se[MAXN];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }
  if (n == 1) {
    printf("1 1\n%d\n1 1\n%d\n1 1\n%d\n", -a[0], 0, 0);
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    if (a[i] < 0) {
      fi[i] = -a[i];
      se[i] = a[i];
    } else {
      fi[i] = -a[i];
      se[i] = a[i];
    }
  }
  printf("%d %d\n", 1, n);
  for (int i = 0; i < n; ++i) {
    printf("%lld ", 1LL * n * fi[i]);
  }
  printf("\n");
  printf("%d %d\n", 1, n - 1);
  for (int i = 0; i < n - 1; ++i) {
    printf("%lld ", 1LL * (n - 1) * se[i]);
  }
  printf("\n");
  printf("%d %d\n", 2, n);
  for (int i = 1; i < n - 1; ++i) {
    printf("0 ");
  }
  printf("%lld\n", 1LL * (n - 1) * se[n - 1]);
}
