#include <bits/stdc++.h>
using namespace std;
const int MAXSIZE = 10000020;
int bufpos;
char buf[MAXSIZE];
void init() {
  buf[fread(buf, 1, MAXSIZE, stdin)] = '\0';
  bufpos = 0;
}
int readint() {
  bool isneg;
  int val = 0;
  for (; !isdigit(buf[bufpos]) && buf[bufpos] != '-'; bufpos++)
    ;
  bufpos += (isneg = buf[bufpos] == '-');
  for (; isdigit(buf[bufpos]); bufpos++) val = val * 10 + buf[bufpos] - '0';
  return isneg ? -val : val;
}
char readchar() {
  for (; isspace(buf[bufpos]); bufpos++)
    ;
  return buf[bufpos++];
}
int readstr(char *s) {
  int cur = 0;
  for (; isspace(buf[bufpos]); bufpos++)
    ;
  for (; !isspace(buf[bufpos]); bufpos++) s[cur++] = buf[bufpos];
  s[cur] = '\0';
  return cur;
}
long long a[100002];
int main() {
  init();
  int n = readint();
  for (int i = 1; i <= n; i++) a[i] = readint();
  if (n == 1) {
    printf("1 1\n0\n1 1\n0\n1 1\n%lld\n", -a[1]);
    return 0;
  }
  printf("%d %d\n", 1, n - 1);
  for (int i = 1; i <= n - 1; i++) {
    long long k = a[i] % n;
    a[i] += k * (n - 1);
    printf("%lld%c", k * (n - 1), " \n"[i == n - 1]);
  }
  printf("%d %d\n", 2, n);
  for (int i = 2; i <= n - 1; i++) printf("0 ");
  printf("%lld\n", 1LL * (a[n] % n) * (n - 1));
  a[n] += (a[n] % n) * (n - 1);
  printf("%d %d\n", 1, n);
  for (int i = 1; i <= n; i++) printf("%lld%c", -a[i], " \n"[i == n]);
}
