#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { int n; cin >> n; int a[n]; rep(i,n)cin >> a[i]; int ans = 0; int flag = 0; rep(i,n){ if(flag == 0){ ans++; flag = 1; }else{ if(a[i] == a[i-1]){ ans++; }else{ flag = 0; } } } cout << ans << endl; return 0; }