#include <bits/stdc++.h>
using namespace std;

#define dump(...) do{print_vars(cout<<"# "<<#__VA_ARGS__<<'=',__VA_ARGS__);cout<<endl;}while(0)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp make_pair
#define mt make_tuple

using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vd=vector<double>;
using vvd=vector<vd>;
using vs=vector<string>;

template<typename T,typename U>bool chmin(T& a,const U& b){return a>b?(a=b,1):0;}
template<typename T,typename U>bool chmax(T& a,const U& b){return a<b?(a=b,1):0;}

void print_vars(ostream&){}
template<typename Car,typename... Cdr>
void print_vars(ostream& os,const Car& car,const Cdr&... cdr){
	print_vars(os<<car<<(sizeof...(cdr)?",":""),cdr...);
}

template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
	return os<<'('<<p.first<<','<<p.second<<')';
}

template<int I,typename Tuple>
void print_tuple(ostream&,const Tuple&){}
template<int I,typename Car,typename... Cdr,typename Tuple>
void print_tuple(ostream& os,const Tuple& t){
	os<<get<I>(t)<<(sizeof...(Cdr)?",":"");
	print_tuple<I+1,Cdr...>(os,t);
}
template<typename... Args>
ostream& operator<<(ostream& os,const tuple<Args...>& t){
	print_tuple<0,Args...>(os<<'(',t);
	return os<<')';
}

template<typename Ch,typename Tr,typename C>
basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){
	os<<'[';
	for(auto i=begin(c);i!=end(c);++i)
		os<<(i==begin(c)?"":" ")<<*i;
	return os<<']';
}

constexpr int INF=1e9;
constexpr int MOD=1e9+7;
constexpr double EPS=1e-9;

int solve_naive(vi a,int i)
{
	queue<tuple<vi,int,int>> q;
	q.emplace(a,i,0);
	set<tuple<vi,int>> vis;
	while(q.size()){
		auto [ca,ci,cc]=q.front(); q.pop();
		if(count(all(ca),1)==0) return cc;
		if(!vis.emplace(ca,ci).second) continue;
		if(0<ci){
			ca[ci-1]^=1;
			q.emplace(ca,ci-1,cc+1);
			ca[ci-1]^=1;
		}
		if(ci+1<a.size()){
			ca[ci+1]^=1;
			q.emplace(ca,ci+1,cc+1);
			ca[ci+1]^=1;
		}
	}
	return -1;
}

int calc(vi a,int i)
{
	int n=a.size();

	int l=n;
	rep(j,n) if(a[j]) chmin(l,j);

	int res=0;
	for(;l<i;res++)
		a[--i]^=1;

	int r=l;
	per(j,n) if(a[j]) chmax(r,j);

	for(;i<r;){
		a[++i]^=1;
		res++;
		if(a[i]){
			a[++i]^=1;
			a[--i]^=1;
			res+=2;
			if(i==r-1)
				break;
		}
	}

	return res;
}

int solve(vi a,int i)
{
	int n=a.size();

	if(count(all(a),1)==1&&a[i])
		return 3;

	int l=INF,r=-INF;
	rep(i,n) if(a[i]) chmin(l,i),chmax(r,i);

	if(i<=l){
		int res=0;
		if(i==l){
			a[++i]^=1;
			a[--i]^=1;
			res+=2;
			r=-INF;
			rep(i,n) if(a[i]) chmax(r,i);
		}
		for(;i<r;){
			a[++i]^=1;
			res++;
			if(a[i]){
				a[++i]^=1;
				a[--i]^=1;
				res+=2;
				if(i==r-1)
					break;
			}
		}
		return res;
	}
	if(r<=i){
		reverse(all(a));
		i=n-1-i;
		return solve(a,i);
	}

	assert(l<i&&i<r);

	int res1=calc(a,i);
	int res2=calc(vi(rbegin(a),rend(a)),n-1-i);
	return min(res1,res2);
}

int main()
{
	#ifndef _GLIBCXX_DEBUG
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	constexpr char endl='\n';
	#endif

	for(int i;cin>>i&&i;){
		i--;
		vi a;
		{
			string s; cin>>s;
			for(char c:s) a.push_back(c=='#');
		}
		cout<<solve(a,i)<<endl;
	}
}