#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define all(x) (x).begin(),(x).end() #define rep(i,m,n) for(int i = m;i < n;++i) #define pb push_back #define fore(i,a) for(auto &i:a) #define rrep(i,m,n) for(int i = m;i >= n;--i) #define INF INT_MAX/2 using namespace std; using ll = long long; using R = double; const ll inf = 1LL << 50; const ll MOD = 1e9 + 7; struct edge { ll from; ll to; ll cost; }; int main(){ int n; string s; cin >> n >> s; if (n == 1) { cout << "NO" << endl; return 0; } int fl = 0; rep(i, 1, n) { if (s[i - 1] == s[i])fl = 1; } if (n >= 4) { cout << "YES" << endl; }else if (n <= 3) { if (fl)cout << "YES" << endl; else cout << "NO" << endl; } return 0; }