#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
ll ans=INF;
void solve(vl v,ll p){
  ll n=v.size();
  ll left=INF;
  rep(i,n){
    if(v[i]==1)chmin(left,i);
  }
  ll ret=0;
  if(left<p){
    ret=p-left;
  }
  else {
    if(left==p){
      v[left]=0;
      v[left+1]^=1;
      ret+=2;
    }
    left=p;
  }
  for(ll x=left;x<p;x++)v[x]^=1;
  ll right=-INF;
  rep(i,n)if(v[i]==1)chmax(right,i);
  //rep(i,n)cout << v[i];cout << endl;
  for(ll x=left;x<right;x++){
    if(x==right-1&&v[right]==0)continue;
    if(v[x+1]==1){
      v[x+1]^=1;
      ret++;
    }
    else{
      ret+=3;
      v[x+2]^=1;
    }
    //rep(i,n)cout << v[i];cout << endl;cout << ret << endl;
  }
  //rep(i,n)cout << v[i];cout << endl;
  chmin(ans,ret);
}
ll perse(string s,ll n){
  ans=INF;
  vl v(s.size());
  rep(i,s.size())if(s[i]=='#')v[i]=1;
  solve(v,n-1);
  rev(all(v));
  solve(v,s.size()-n);
  if(ans==INF){
    return 3;
    //cout << 3 << endl;
  }
  else {
    return ans;
   // cout << ans << endl;
  }
}
ll naive(string s,ll p){
   ll n;
    n=s.size();
    ll bit=0;
    rep(i,n)if(s[i]=='#')bit|=1<<i;
    vvl dp(1<<n,vl(n,INF));p--;
    dp[bit][p]=0;
    queue<pl> que;que.push({bit,p});
    while(que.size()){
        auto [bit,pos]=que.front();que.pop();
        if(pos>=1){
            ll npos=pos-1;
            if(dp[bit^(1<<npos)][npos]==INF){
                dp[bit^(1<<npos)][npos]=dp[bit][pos]+1;
                que.push({(bit^(1<<npos)),npos});
            }
        }
        if(pos<n-1){
            ll npos=pos+1;
            if(dp[bit^(1<<npos)][npos]==INF){
                dp[bit^(1<<npos)][npos]=dp[bit][pos]+1;
                que.push({(bit^(1<<npos)),npos});
            }
        }
    }
    ll ret=INF;
    rep(i,n)chmin(ret,dp[0][i]);
    return ret;
    //cout << ret << endl;
}
int main(){
  ll n;cin >> n;
  string s;cin >> s;
  ll cnt=0;rep(i,n)if(s[i]=='#')cnt++;
  if(cnt==1&&(n==1||n==s.size())&&s[n-1]=='#'){
      cout << 3 << endl;return 0;
  }
  cout << perse(s,n) << endl;
}