#include <bits/stdc++.h>
using namespace std;
void IO() {}
int ar[200005];
char ch[200005];
int m, n, k, ii;
void solve() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &ar[i]);
  if (n == 1) {
    printf("1 1\n%d\n", (-1) * ar[1]);
    printf("1 1\n%d\n", 0);
    printf("1 1\n%d\n", 0);
    return;
  }
  if (n == 2) {
    printf("1 1\n%d\n", (-1) * ar[1]);
    printf("2 2\n%d\n", (-1) * ar[2]);
    printf("1 1\n%d\n", 0);
    return;
  }
  if (n == 3) {
    printf("1 1\n%d\n", (-1) * ar[1]);
    printf("2 2\n%d\n", (-1) * ar[2]);
    printf("3 3\n%d\n", (-1) * ar[3]);
    return;
  }
  printf("1 1\n%d\n", (-1) * ar[1]);
  int val = n - 1;
  vector<long long> v;
  for (int i = 2; i <= n; i++) {
    long long tem = (long long)val * ar[i];
    v.push_back(tem);
  }
  printf("2 %d\n", n);
  for (long long i : v) printf("%lld ", i);
  printf("\n");
  printf("1 %d\n", n);
  ar[1] = 0;
  for (int i = 1; i <= n; i++) printf("%lld ", (-1) * ((long long)ar[i] * n));
  printf("\n");
}
int main() {
  IO();
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
