#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,L;
string S;

void out(string a) {
	FORR(c,a) cout<<(c?'#':'.');
	cout<<endl;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>S;
	L=S.size();
	N--;
	FORR(c,S) c=(c=='#');
	ll mi=1LL<<60;
	FOR(i,2) {
		string T=S;
		int LL=L+1,RR=-1;
		int cnt=0;
		FOR(j,L) {
			if(S[j]) {
				cnt++;
				LL=min(LL,j);
				RR=j;
			}
		}
		
		
		ll tot=0;
		int cur=N;
		
		if(LL<cur) {
			for(j=LL;j<cur;j++) {
				cnt-=T[j];
				T[j]^=1;
				cnt+=T[j];
			}
			tot=cur-LL;
			cur=LL;
		}
		while(cnt) {
			if(T[cur]) {
				tot+=2;
				T[cur]=0;
				cnt--;
				cnt-=T[cur+1];
				T[cur+1]^=1;
				cnt+=T[cur+1];
			}
			if(cnt==0) break;
			
			tot++;
			cur++;
			cnt-=T[cur];
			T[cur]^=1;
			cnt+=T[cur];
		}
		
		
		
		mi=min(mi,tot);
		reverse(ALL(S));
		N=L-1-N;
	}
	cout<<mi<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}