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