#include <bits/stdc++.h>
using namespace std;
long long N, A[100005], R[100005];
int main() {
  scanf("%lld", &N);
  for (int i = 1; i <= N; ++i) scanf("%lld", &A[i]);
  if (N == 1) {
    printf("1 1\n0\n1 1\n0\n1 1\n%lld\n", -A[1]);
    return 0;
  }
  printf("%d %d\n%lld\n", 1, 1, N - A[1]);
  A[1] = N;
  printf("%d %d\n", 2, N);
  long long L = N - 1;
  for (long long i = 1; i <= N; ++i) {
    long long r = (L * i) % N;
    R[r] = L * i;
  }
  for (int i = 0; i < N; ++i) assert(R[i] > 0);
  for (int i = 2; i <= N; ++i) {
    long long t = (1000000007 + L) / L * L;
    assert(A[i] + t >= 0);
    long long rem = (A[i] + t) % N;
    printf("%lld ", t - R[rem]);
    A[i] += t - R[rem];
  }
  printf("\n");
  printf("%d %d\n", 1, N);
  for (int i = 1; i <= N; ++i) {
    assert(A[i] % N == 0);
    printf("%lld ", -A[i]);
  }
  printf("\n");
}
