/*
  Solution to problem: 345 - Mixtures
  (From the Sphere Online Judge -  http://www.spoj.pl)

  Author: Andres Mejia-Posada
  http://blogaritmo.factorcomun.org
 */
#include <iostream>
#include <algorithm>

using namespace std;

int main(){
  int n;
  while (cin >> n){
    int colors[n][n]; //colors[i][j] = Resulting color from mixing potions i-th to j-th, both included.
    for (int i = 0; i < n; ++i){
      cin >> colors[i][i];
    }
    for (int i = 0; i < n; ++i){
      for (int j=i+1; j<n; ++j){
        colors[i][j] = (colors[i][j-1]+colors[j][j])%100;
      }
    }

    int dp[n][n]; //dp[i][j] = Minimum smoke generated while mixing potions i-th to j-th, both included.
    for (int i = 0; i < n; ++i){
      for (int j=i+1; j<n; ++j){
        dp[i][j] = INT_MAX;
      }
      dp[i][i] = 0;
    }

    for (int i = n-1; i >= 0; --i){
      for (int j=i; j<n; ++j){
        for (int k=i; k<j; ++k){
          dp[i][j] <?= dp[i][k] + dp[k+1][j] + colors[i][k] * colors[k+1][j];
        }
      }
    }

    cout << dp[0][n-1] << endl;
  }
  return 0;
}