#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
 
long long int INF = 1e18;
const ll fact_table = 800008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
// #define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
 
 
ll mod = 998244353;
// ll mod = 1000000007;
  
ll mypow(ll number1,ll number2, ll mod){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = mypow(number1,number2 / 2, mod);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 
/*
ll fact[fact_table + 5],rfact[fact_table + 5];
 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = rui(fact[fact_table],mod - 2);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/
bool multicase = false;

ll n,m,num,sum,a,b,c,d,e,h,q,p;
ll w, ans;
ll k;
char s[105][105];
vector<P> G[500005];
ll cost[100005];

void solve(){
    cin >> h >> w;
    for(ll i=0;i<h;i++){
        cin >> s[i];
    }
    for(ll i=0;i<h;i++){
        for(ll j=0;j<w;j++){
            ll x = i, y = j;
            for(ll k=0;k<2;k++){
                ll nx = i + dx[k], ny = j + dy[k];
                if(nx < 0 || ny < 0 || nx >= h || ny >= w)continue;
                ll fromid = i * w + j;
                ll toid = nx * w + ny;
                if(s[x][y] == s[nx][ny]){
                    G[fromid].pb(P(toid, 0));
                }else{
                    G[fromid].pb(P(toid, 1));
                }
            }
        }
    }
    ll c1 = 0, c2 = 0;
    if(s[0][0] == '#')c1++;
    if(s[h-1][w-1] == '#')c2++;
    G[h*w].pb(P(0, c1));
    G[h*w-1].pb(P(h*w+1, c2));
    for(ll i=0;i<h*w+10;i++){
        cost[i] = INF;
    }
    cost[h*w] = 0;
    pqps.push(P(0, h*w));
    while(!pqps.empty()){
        P p = pqps.top();
        pqps.pop();
        ll v = p.second;
        ll nowcost = p.first;
        if(nowcost > cost[v])continue;
        for(ll i=0;i<G[v].size();i++){
            ll nv = G[v][i].first;
            ll newcost = cost[v] + G[v][i].second;
            if(cost[nv] > newcost){
                cost[nv] = newcost;
                pqps.push(P(newcost, nv));
            }

        }
    }
    ll ans = cost[h*w+1];
    p(ans / 2);
    return;
}

int main(){
    // init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q;
    if(multicase){
        cin >> q;
    }else{
        q = 1;
    }
    while(q--){
        solve();
    }
    return 0;

}


















Measured memory_bytes: 12544