void solve(){
      int n;
      cin >> n;
      if(n&1) cout << "Kosuke\n";
      else cout << "Sakurako\n";
    }

void solve(){
    int n;
    cin >> n;
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= n;j++){
            cin >> a[i][j];
        }
    }
    vector<int>sum(2*n);
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= n;j++){
            sum[j - i + n] = std::max(-a[i][j],sum[j - i + n]); //如果在一条主对角线上则必然有j - i + n相等
        }
    }
    int ans = 0;
    for(auto t:sum){
        ans += t;
    }
    cout << ans << '\n';
    }

void solve(){
    int n;
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
    }
    for(int i = 2;i <= n/2;i++){
        if(a[i] == a[i - 1] || a[n - i + 2] == a[n - i + 1]) std::swap(a[n - i + 1],a[i]);
    }
    int ans = 0;
    for(int i = 2;i <= n;i++){
        if(a[i] == a[i - 1]) ans++;
    }
    cout << ans << '\n';
}

void solve(){
    int n = 0;
    cin >> n;
    std::map<int,bool>m;
    int sum = 0,ans = 0;
    m[0] = 1;
    for(int i = 1,x;i <= n;i++){
        cin >> x;
        sum += x;
        if(m[sum]){
            ans++;
            m.clear();
            sum = 0;
        }
        m[sum] = 1;
    }
    cout << ans << '\n';
}