Language: C++

#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}
#include <map>
#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <bits/stdc++.h>
#include <complex>
#include <numeric>
#include <climits>
#include <stack>
#include <locale.h>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <ctime>
#include <deque>
#include <queue>
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define rept(i,n)for(int i=0;i<(int)(n);i++)
#define fi first
#define se second
using namespace std;
int n,a[200005],t;
int l=0,r=0;
int k,d;
int main() {
	cin>>n;
	t=n;
	for(int i=0; i<n; i++) {
		cin>>a[i];
	}
	r++;
	k=a[l];
	d=a[l];
	while(n>l&&n>r) {
		k=k^a[r];
		d=d+a[r];
		if(k==d&&r<n)
			t++,r++;
		if(r==n) {
			l++,r=l+1;
			if(r>=n) break;
			continue;
		} else if(k!=d) {
			l++,r=l+1;
			if(r>=n)break;
			k=a[l];
			d=a[l];
		}
	}
	cout<<t;
	return 0;
}


Compiler output:
a.cc:80:5: error: redefinition of 'int n'
   80 | int n,a[200005],t;
      |     ^
a.cc:25:5: note: 'int n' previously declared here
   25 | int n,a[200005],t;
      |     ^
a.cc:80:7: error: redefinition of 'int a [200005]'
   80 | int n,a[200005],t;
      |       ^
a.cc:25:7: note: 'int a [200005]' previously declared here
   25 | int n,a[200005],t;
      |       ^
a.cc:80:17: error: redefinition of 'int t'
   80 | int n,a[200005],t;
      |                 ^
a.cc:25:17: note: 'int t' previously declared here
   25 | int n,a[200005],t;
      |                 ^
a.cc:81:5: error: redefinition of 'int l'
   81 | int l=0,r=0;
      |     ^
a.cc:26:5: note: 'int l' previously defined here
   26 | int l=0,r=0;
      |     ^
a.cc:81:9: error: redefinition of 'int r'
   81 | int l=0,r=0;
      |         ^
a.cc:26:9: note: 'int r' previously defined here
   26 | int l=0,r=0;
      |         ^
a.cc:82:5: error: redefinition of 'int k'
   82 | int k,d;
      |     ^
a.cc:27:5: note: 'int k' previously declared here
   27 | int k,d;
      |     ^
a.cc:82:7: error: redefinition of 'int d'
   82 | int k,d;
      |       ^
a.cc:27:7: note: 'int d' previously declared here
   27 | int k,d;
      |       ^
a.cc:83:5: error: redefinition of 'int main()'
   83 | int main() {
      |     ^~~~
a.cc:28:5: note: 'int main()' previously defined here
   28 | int main() {
      |     ^~~~
a.cc:135:5: error: redefinition of 'int n'
  135 | int n,a[200005],t;
      |     ^
a.cc:25:5: note: 'int n' previously declared here
   25 | int n,a[200005],t;
      |     ^
a.cc:135:7: error: redefinition of 'int a [200005]'
  135 | int n,a[200005],t;
      |       ^
a.cc:25:7: note: 'int a [200005]' previously declared here
   25 | int n,a[200005],t;
      |       ^
a.cc:135:17: error: redefinition of 'int t'
  135 | int n,a[200005],t;
      |                 ^
a.cc:25:17: note: 'int t' previously declared here
   25 | int n,a[200005],t;
      |                 ^
a.cc:136:5: error: redefinition of 'int l'
  136 | int l=0,r=0;
      |     ^
a.cc:26:5: note: 'int l' previously defined here
   26 | int l=0,r=0;
      |     ^
a.cc:136:9: error: redefinition of 'int r'
  136 | int l=0,r=0;
      |         ^
a.cc:26:9: note: 'int r' previously defined here
   26 | int l=0,r=0;
      |         ^
a.cc:137:5: error: redefinition of 'int k'
  137 | int k,d;
      |     ^
a.cc:27:5: note: 'int k' previously declared here
   27 | int k,d;
      |     ^
a.cc:137:7: error: redefinition of 'int d'
  137 | int k,d;
      |       ^
a.cc:27:7: note: 'int d' previously declared here
   27 | int k,d;
      |       ^
a.cc:138:5: error: redefinition of 'int main()'
  138 | int main() {
      |     ^~~~
a.cc:28:5: note: 'int main()' previously defined here
   28 | int main() {
      |     ^~~~
a.cc:190:5: error: redefinition of 'int n'
  190 | int n,a[200005],t;
      |     ^
a.cc:25:5: note: 'int n' previously declared here
   25 | int n,a[200005],t;
      |     ^
a.cc:190:7: error: redefinition of 'int a [200005]'
  190 | int n,a[200005],t;
      |       ^
a.cc:25:7: note: 'int a [200005]' previously declared here
   25 | int n,a[200005],t;
      |       ^
a.cc:190:17: error: redefinition of 'int t'
  190 | int n,a[200005],t;
      |                 ^
a.cc:25:17: note: 'int t' previously declared here
   25 | int n,a[200005],t;
      |                 ^
a.cc:191:5: error: redefinition of 'int l'
  191 | int l=0,r=0;
      |     ^
a.cc:26:5: note: 'int l' previously defined here
   26 | int l=0,r=0;
      |     ^
a.cc:191:9: error: redefinition of 'int r'
  191 | int l=0,r=0;
      |         ^
a.cc:26:9: note: 'int r' previously defined here
   26 | int l=0,r=0;
      |         ^
a.cc:192:5: error: redefinition of 'int k'
  192 | int k,d;
      |     ^
a.cc:27:5: note: 'int k' previously declared here
   27 | int k,d;
      |     ^
a.cc:192:7: error: redefinition of 'int d'
  192 | int k,d;
      |       ^
a.cc:27:7: note: 'int d' previously declared here
   27 | int k,d;
      |       ^
a.cc:193:5: error: redefinition of 'int main()'
  193 | int main() {
      |     ^~~~
a.cc:28:5: note: 'int main()' previously defined here
   28 | int main() {
      |     ^~~~
a.cc:245:5: error: redefinition of 'int n'
  245 | int n,a[200005],t;
      |     ^
a.cc:25:5: note: 'int n' previously declared here
   25 | int n,a[200005],t;
      |     ^
a.cc:245:7: error: redefinition of 'int a [200005]'
  245 | int n,a[200005],t;
      |       ^
a.cc:25:7: note: 'int a [200005]' previously declared here
   25 | int n,a[200005],t;
      |       ^
a.cc:245:17: error: redefinition of 'int t'
  245 | int n,a[200005],t;
      |                 ^
a.cc:25:17: note: 'int t' previously declared here
   25 | int n,a[200005],t;
      |                 ^
a.cc:246:5: error: redefinition of 'int l'
  246 | int l=0,r=0;
      |     ^
a.cc:26:5: note: 'int l' previously defined here
   26 | int l=0,r=0;
      |     ^
a.cc:246:9: error: redefinition of 'int r'
  246 | int l=0,r=0;
      |         ^
a.cc:26:9: note: 'int r' previously defined here
   26 | int l=0,r=0;
      |         ^
a.cc:247:5: error: redefinition of 'int k'
  247 | int k,d;
      |     ^
a.cc:27:5: note: 'int k' previously declared here
   27 | int k,d;
      |     ^
a.cc:247:7: error: redefinition of 'int d'
  247 | int k,d;
      |       ^
a.cc:27:7: note: 'int d' previously declared here
   27 | int k,d;
      |       ^
a.cc:248:5: error: redefinition of 'int main()'
  248 | int main() {
      |     ^~~~
a.cc:28:5: note: 'int main()' previously defined here
   28 | int main() {
      |     ^~~~
a.cc:300:5: error: redefinition of 'int n'
  300 | int n,a[200005],t;
      |     ^
a.cc:25:5: note: 'int n' previously declared here
   25 | int n,a[200005],t;
      |     ^
a.cc:300:7: error: redefinition of 'int a [200005]'
  300 | int n,a[200005],t;
      |       ^
a.cc:25:7: note: 'int a [200005]' previously declared here
   25 | int n,a[200005],t;
      |       ^
a.cc:300:17: error: redefinition of 'int t'
  300 | int n,a[200005],t;
      |                 ^
a.cc:25:17: note: 'int t' previously declared here
   25 | int n,a[200005],t;
      |                 ^
a.cc:301:5: error: redefinition of 'int l'
  301 | int l=0,r=0;
      |     ^
a.cc:26:5: note: 'int l' previously defined here
   26 | int l=0,r=0;
      |     ^
a.cc:301:9: error: redefinition of 'int r'
  301 | int l=0,r=0;
      |         ^
a.cc:26:9: note: 'int r' previously defined here
   26 | int l=0,r=0;
      |         ^
a.cc:302:5: error: redefinition of 'int k'
  302 | int k,d;
      |     ^
a.cc:27:5: note: 'int k' previously declared here
   27 | int k,d;
      |     ^
a.cc:302:7: error: redefinition of 'int d'
  302 | int k,d;
      |       ^
a.cc:27:7: note: 'int d' previously declared here
   27 | int k,d;
      |       ^
a.cc:303:5: error: redefinition of 'int main()'
  303 | int main() {
      |     ^~~~
a.cc:28:5: note: 'int main()' previously defined here
   28 | int main() {
      |     ^~~~
a.cc:355:5: error: redefinition of 'int n'
  355 | int n,a[200005],t;
      |     ^
a.cc:25:5: note: 'int n' previously declared here
   25 | int n,a[200005],t;
      |     ^
a.cc:355:7: error: redefinition of 'int a [200005]'
  355 | int n,a[200005],t;
      |       ^
a.cc:25:7: note: 'int a [200005]' previously declared here
   25 | int n,a[200005],t;
      |       ^
a.cc:355:17: error: redefinition of 'int t'
  355 | int n,a[200005],t;
      |                 ^
a.cc:25:17: note: 'int t' previously declared here
   25 | int n,a[200005],t;
      |                 ^
a.cc:356:5: error: redefinition of 'int l'
  356 | int l=0,r=0;
      |     ^
a.cc:26:5: note: 'int l' previously defined here
   26 | int l=0,r=0;
      |     ^
a.cc:356:9: error: redefinition of 'int r'
  356 | int l=0,r=0;
      |         ^
a.cc:26:9: note: 'int r' previously defined here
   26 | int l=0,r=0;
      |         ^
a.cc:357:5: error: redefinition of 'int k'
  357 | int k,d;
      |     ^
a.cc:27:5: note: 'int k' previously declared here
   27 | int k,d;
      |     ^
a.cc:357:7: error: redefinition of 'int d'
  357 | int k,d;
      |       ^
a.cc:27:7: note: 'int d' previously declared here
   27 | int k,d;
      |       ^
a.cc:358:5: error: redefinition of 'int main()'
  358 | int main() {
      |     ^~~~
a.cc:28:5: note: 'int main()' previously defined here
   28 | int main() {
      |     ^~~~
a.cc:410:5: error: redefinition of 'int n'
  410 | int n,a[200005],t;
      |     ^
a.cc:25:5: note: 'int n' previously declared here
   25 | int n,a[200005],t;
      |     ^
a.cc:410:7: error: redefinition of 'int a [200005]'
  410 | int n,a[200005],t;
      |       ^
a.cc:25:7: note: 'int a [200005]' previously declared here
   25 | int n,a[200005],t;
      |       ^
a.cc:410:17: error: redefinition of 'int t'
  410 | int n,a[200005],t;
      |                 ^
a.cc:25:17: note: 'int t' previously declared here
   25 | int n,a[200005],t;
      |                 ^
a.cc:411:5: error: redefinition of 'int l'
  411 | int l=0,r=0;
      |     ^
a.cc:26:5: note: 'int l' previously defined here
   26 | int l=0,r=0;
      |     ^
a.cc:411:9: error: redefinition of 'int r'
  411 | int l=0,r=0;
      |         ^
a.cc:26:9: note: 'int r' previously defined here
   26 | int l=0,r=0;
      |         ^
a.cc:412:5: error: redefinition of 'int k'
  412 | int k,d;
      |     ^
a.cc:27:5: note: 'int k' previously declared here
   27 | int k,d;
      |     ^
a.cc:412:7: error: redefinition of 'int d'
  412 | int k,d;
      |       ^
a.cc:27:7: note: 'int d' previously declared here
   27 | int k,d;
      |       ^
a.cc:413:5: error: redefinition of 'int main()'
  413 | int main() {
      |     ^~~~
a.cc:28:5: note: 'int main()' previously defined here
   28 | int main() {
      |     ^~~~
a.cc:465:5: error: redefinition of 'int n'
  465 | int n,a[200005],t;
      |     ^
a.cc:25:5: note: 'int n' previously declared here
   25 | int n,a[200005],t;
      |     ^
a.cc:465:7: error: redefinition of 'int a [200005]'
  465 | int n,a[200005],t;
      |       ^
a.cc:25:7: note: 'int a [200005]' previously declared here
   25 | int n,a[200005],t;
      |       ^
a.cc:465:17: error: redefinition of 'int t'
  465 | int n,a[200005],t;
      |                 ^
a