#include <bits/stdc++.h>
using i64 = long long;
constexpr int P = 1000000007;
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n;
    std::cin >> n;
    std::vector<int> a(n);
    std::vector<std::vector<i64>> dp(n + 1, std::vector<i64>(2));
    std::vector<std::vector<int>> cnt(n + 1, std::vector<int>(2));
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    dp[0][0] = a[0];
    cnt[0][0] = 1;
    for (int i = 1; i < n; i++) {
        cnt[i][0] = (cnt[i - 1][0] + cnt[i - 1][1]) % P;
        cnt[i][1] = cnt[i - 1][0];
        dp[i][0] = (dp[i - 1][0] + dp[i - 1][1] + i64(a[i]) * cnt[i - 1][0] % P + i64(a[i]) * cnt[i - 1][1] % P + P) % P;
        dp[i][1] = (dp[i - 1][0] - i64(a[i]) * cnt[i - 1][0] % P + P) % P;
    }
    std::cout << (dp[n - 1][0] + dp[n - 1][1]) % P << "\n";
    return 0;
}
#include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPP(i, n) for(int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
    long long c = a % i_7;
    if(c >= 0) return c;
    return c + i_7;
}
long long po(long a, long b){
    if(b == 0) return 1;
    
    long long z = po(a , b / 2);
    z = mod(z * z);
    if(b % 2 != 0) z = mod(a * z);
    return z;
}

bool prime_(int n){
    if(n == 1){
        return false;
    }else if(n == 2){
        return true;
    }else{
        for(int i = 2; i <= std::sqrt(n); i++) if(n % i == 0) return false;
        return true;
    }
}

long long gcd_(long long a, long long b){
    if(a < b) std::swap(a,b);
    if(a % b == 0) return b;
    else return gcd_(b, a % b);
}

long long lcm_(long long x, long long y){
    return (x / gcd_(x,y)) * y;
}

using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//using mint = modint998244353;
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;

int main(){
  //using namespace std;
  
  int x;
  cin>>x;
  int ans = ((x + 99) / 100) * 100 - x;
  if(ans == 0) ans = 100;
  cout << ans << endl;
  return 0;
}