#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=100000;
int B=1000000;
int main(){
      int n;
      string s;
      int cnt[1000000];
      cin>>n>>s;
      REP(i,s.size()){
            cnt[i]=s[i]-'0';
            if(i!=0)cnt[i]+=cnt[i-1];
      }
      bool f=false;
      REP(i,n){
            for(int j=i;j+j+1-i<n;j++){
                  if(cnt[j]-cnt[i]==cnt[j+j+1-i]-cnt[j+1])f=true;
            }
      }
      if(f)cout<<"YES"<<endl;
      else cout<<"NO"<<endl;
}