problem

AOR Ika is studying to pass the test.

AOR Ika-chan solved the $ N $ question. After that, round the solved problem according to the following procedure.

1. Check the correctness of the answer.
2. If the answer is correct, write a circle mark, and if it is incorrect, write a cross mark on the answer sheet.



AOR Ika faints because of the fear of failing the test the moment she finds that the answer is wrong for $ 2 $ in a row. And no further rounding is possible.

Syncope occurs between steps $ 1 $ and $ 2 $.

You will be given an integer $ N $, which represents the number of questions AOR Ika has solved, and a string $ S $, which is a length $ N $ and represents the correctness of the answer. The string consists of'o'and'x', with'o' indicating the correct answer and'x' indicating the incorrect answer. The $ i $ letter indicates the correctness of the $ i $ question, and AOR Ika-chan rounds the $ 1 $ question in order.

Please output the number of questions that AOR Ika-chan can write the correctness.



output

Output the number of questions that AOR Ika-chan could write in the $ 1 $ line. Also, output a line break at the end.

Example

Input

3
oxx


Output

2
#include <bits/stdc++.h>
#define FOR(i,a,b) for(ut i=(a);i<(ut)(b);i++)
#define REP(i,b) FOR(i,0,b)
#define ALL(c) c.begin(),c.end()
#define PB push_back
#define cat //cout << __LINE__ << endl;
using namespace std;
typedef long long LL;
typedef double ld;
typedef LL ut;
typedef vector<ut> VI;
typedef pair<ut,ut> pr;
typedef pair<ut,pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef priority_queue<ut,VI> PQ;
const int SIZE=2*1e5;
const LL INF=-1+(1LL<<61);
const LL p=7+1e9;

int main(){
	int N;
	string s;
	cin >> N;
	cin >> s;
	int ans=s.size();
	REP(i,s.size()){
		if(i && s[i]=='x' && s[i-1]=='x'){
			ans=i;
			break;
		}
	}
	cout << ans << endl;

	return 0;
}