#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <climits>
using namespace std;
#define ll long long
int maxVal(int x, int y) { return (x > y)? x: y; }
int getMid(int s, int e) {  return s + (e -s)/2;  }
int RMQUtil(int *st, int ss, int se, int qs, int qe, int index)
{
    if (qs <= ss && qe >= se)
        return st[index];
    if (se < qs || ss > qe)
        return INT_MIN;
    int mid = getMid(ss, se);
    return maxVal(RMQUtil(st, ss, mid, qs, qe, 2*index+1),
                  RMQUtil(st, mid+1, se, qs, qe, 2*index+2));
}

int RMQ(int *st, int n, int qs, int qe)
{
    return RMQUtil(st, 0, n-1, qs, qe, 0);
}

int constructSTUtil(int arr[], int ss, int se, int *st, int si)
{
    if (ss == se)
    {
        st[si] = arr[ss];
        return arr[ss];
    }
    int mid = getMid(ss, se);
    st[si] =  maxVal(constructSTUtil(arr, ss, mid, st, si*2+1),
                     constructSTUtil(arr, mid+1, se, st, si*2+2));
    return st[si];
}

int *constructST(int arr[], int n)
{
    int x = (int)(ceil(log2(n))); 
    int max_size = 2*(int)pow(2, x) - 1; 
    int *st = new int[max_size]; 
    constructSTUtil(arr, 0, n-1, st, 0);
    return st;
}

int gcd(int a,int b)
{
    a=abs(a);
    b=abs(b);
    if(b==0) return a;
    else
      return  gcd(b,a%b);
}

int main() 
{
    int  n;
    cin >> n ;
    int arr[n];
    for(int i=0;i<n;i++) cin >> arr[i];
    ll sumarr[n];
    sumarr[0]=arr[0];
    for(int i=1;i<n;i++) sumarr[i]=sumarr[i-1]+arr[i];
    
    int * st = constructST(arr,n);
    
    int ans[100][100];
    for(int i=0;i<n;i++)
    {
        for(int j=i;j<n;j++)
        {
            ll sumans=0;
            for(int k=i;k<=j;k++) sumans+=arr[i];
            cout<<gcd(i,j)*(sumans - RMQ(st,n,i,j))<<"\n";
           
        }
    }

    
    
}