#include <bits/stdc++.h>
int n;
long long a[1000005];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
  if (n == 1) {
    printf("1 1 %lld\n1 1 0\n1 1 0\n", -a[1]);
    return 0;
  }
  printf("%d %d\n", 1, n);
  for (int i = 1; i <= n; ++i) {
    printf("%lld ", -n * a[i]);
    a[i] = (a[i] - n * a[i]);
  }
  puts("");
  printf("%d %d\n", 1, n - 1);
  for (int i = 1; i < n; ++i) {
    assert(a[i] % (n - 1) == 0);
    printf("%lld ", -a[i]);
  }
  puts("");
  printf("%d %d\n", n, n);
  printf("%lld ", -a[n]);
  return 0;
}
