#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 7;
const int N = 2e5 + 10;
long long a[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  if (n == 1) {
    puts("1 1");
    printf("%d\n", -a[1]);
    puts("1 1");
    puts("0");
    puts("1 1");
    puts("0");
    return 0;
  }
  printf("2 %d\n", n);
  for (int i = 2; i <= n; i++) {
    int o = a[i] % n;
    if (o < 0) o += n;
    a[i] += 1LL * o * (n - 1);
    printf("%lld ", 1LL * o * (n - 1));
  }
  puts("");
  printf("1 %d\n", n);
  printf("0");
  for (int i = 2; i <= n; i++) {
    printf(" %lld", -a[i]);
  }
  puts("");
  puts("1 1");
  printf("%lld\n", -a[1]);
  return 0;
}
