#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}


template <typename T>
class Edge {
public:
    Edge(int input_to, T input_cap, int input_rev) :
        to(input_to), cap(input_cap), rev(input_rev), init_cap(input_cap) {
    }

    int to;
    T   cap;
    int rev;
    T   init_cap;
};

template <typename T>
class Dinic {

	int maxv;
	vector<vector<Edge<T>>> G;
	vector<int> level;
	vector<int> iter;

   public:
	static const T DINIC_INF = (sizeof(T) > 4) ? LLONG_MAX : INT_MAX;

   public:
	Dinic(int input_maxv) : maxv(input_maxv) {
		G.resize(input_maxv);
		level.resize(input_maxv);
		iter.resize(input_maxv);
	}

	void add_edge_both(int from, int to, T cap) {
		const int rev_from  = G[from].size();
		const int rev_to    = G[to].size();
		G[from].push_back(Edge<T>(to, cap, rev_to));
		G[to].push_back(Edge<T>(from, cap, rev_from));
	}

	void add_edge(int from, int to, T cap) {
		const int rev_from  = G[from].size();
		const int rev_to    = G[to].size();
		G[from].push_back(Edge<T>(to, cap, rev_to));
		G[to].push_back(Edge<T>(from, (T)0, rev_from));
	}

	T max_flow(int s, int t) {
		T flow = 0;
		while (true) {
			bfs(s);
			if (level[t] < 0) break;
			fill(ALL(iter), 0);
			T f;
			while ((f = dfs(s, t, DINIC_INF)) > 0) {
				flow += f;
			}
		}
		return flow;
	}

	vector<bool> get_nodes_in_group(int s) {
		vector<bool> ret(maxv);

		queue<int> q;
		q.push(s);
		while (!q.empty()) {
			int v = q.front();
			q.pop();
			ret[v] = true;

            rep(i, G[v].size()) {
				Edge<T> &e = G[v][i];
				if (e.cap > 0 && !ret[e.to]) {
					q.push(e.to);
				}
			}
		}
		return ret;
	}

	void disp() {
        rep(v, maxv) {
			fprintf(stderr, "%d:", v);
            rep(i, G[v].size()) {
				if (G[v][i].init_cap > 0) {
					fprintf(stderr, "->%d(%d),", G[v][i].to, G[v][i].init_cap);
				}
			}
			fprintf(stderr, "\n");
		}
	}

private:
	void bfs(int s) {
		fill(ALL(level), -1);
		queue<int> q;
		level[s] = 0;
		q.push(s);
		while (!q.empty()) {
			int v = q.front();
			q.pop();
            rep(i, G[v].size()) {
				Edge<T> &e = G[v][i];
				if (e.cap > 0 && level[e.to] < 0) {
					level[e.to] = level[v] + 1;
					q.push(e.to);
				}
			}
		}
	}

	int dfs(int v, int t, T f) {
		if (v == t) return f;
		for (int &i=iter[v]; i<G[v].size(); i++) {
			Edge<T>& e = G[v][i];
			if (e.cap > 0 && level[v] < level[e.to]) {
				T d = dfs(e.to, t, min(f, e.cap));
				if (d > 0) {
					e.cap -= d;
					G[e.to][e.rev].cap += d;
					return d;
				}
			}
		}
		return 0;
	}
};

ll solve(int N, vi& a) {
	const int S = N+1;
	const int T = S+1;

    Dinic<ll>* dinic = new Dinic<ll>(T+1);
    ll answer = 0;
    rep1(i,N) {
        int a_i = a[i-1];
        if (a_i <= 0) {
            dinic->add_edge(S, i, -a_i);
        } else {
            answer += a_i;
            dinic->add_edge(i, T, a_i);
        }
        for (int k=i; k<=N; k+=i) {
            dinic->add_edge(i, k, Dinic<ll>::DINIC_INF);
        }
    }
    answer -= dinic->max_flow(S, T);

    delete dinic;

    return answer;
}

int main() {
    vi a;
    int N = loadvec(a);
    cout << solve(N,a) << endl;
    return 0;
}


Measured memory_bytes: 256