#define ll long long int
#include <bits/stdc++.h>

using namespace std;

#define         ff               first
#define         ss               second
#define         mp               make_pair
#define         pb               push_back
#define         pf               push_front
#define         vi               vector<ll>
#define         pii              pair<ll,ll>
#define         qi               queue<ll>
#define         mem(a,b)         memset(a,b,sizeof(a))
#define         print(a)         cout << a << '\n'
#define         print2(a)        cout << a << ' '
#define         sorted(arr)      sort(arr.begin(),arr.end())
#define         gcd(a,b)         __gcd((a),(b))
#define         lcm(a,b)         ((a)*(b))/gcd((a),(b))
#define         all(v)           v.begin(),v.end()
#define         read(a)          scanf("%d", &a)
#define         f(a,n)           for(ll i = a ; i < n ; i++)
#define         in(a , n)        for(ll i = 0 ; i < n ; i ++) cin >> a[i];
#define         in2(n,m,arr)     for(ll i = 0 ; i < n ; i++){ for(ll j = 0; j < m ; j++) cin >> arr[i][j]; }
#define         debug(a)         cerr<<a<<" ";
#define         debug1(a)        cerr<<a<<'\n'
 

const unsigned ll mod = 1e9 + 7;
const ll inf = (ll)1e18 + 2;
const ll N = (ll)4e5 + 2;

ll power(ll x , ll y) {
    ll res = 1;
    while (y > 0) {
        if (y & 1)
            res = (res * x) % mod ;
        y = y >> 1;
        x = (x * x) % mod ;
    }
    return res % mod ;
}

void solve() {
    ll n , m;
    cin >> n >> m;
    char arr[n][m];
    ll dp[n][m];
    mem(dp , 0);
    in2(n , m , arr);
    for(ll i = 0 ; i < n ; i ++) {
        for(ll j = 0 ; j < m ; j ++) {
            if(i == 0 and j == 0)
            {
                if(arr[i][j] == '#')
                    dp[i][j] = 1;
                continue;
                
            }
            ll t1 = inf , t2 = inf;
            if(i - 1 >= 0) {
                if(arr[i][j] == arr[i - 1][j])
                    t1 = dp[i - 1][j];
                else if(arr[i][j] == '#')
                    t1 = dp[i - 1][j] + 1;
                else t1 = dp[i - 1][j];
            }
            if(j - 1 >= 0 ) {
                if(arr[i][j] == arr[i][j - 1])
                    t2 = dp[i][j - 1];
                else if(arr[i][j] == '#')
                    t2 = dp[i][j - 1] + 1;
                else t2 = dp[i][j - 1];
            }
            dp[i][j] = min(t1 , t2);
        }
    }
    cout << dp[n - 1][m - 1] << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll te = 1;
    //cin >> te ;
    while(te --) {
        solve();
    }
    
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}
 

/* ---------------------------------------------------------------------------------------------------------------------



#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag , tree_order_statistics_node_update> Set;

 
vector<ll> ar ;

ll get(ll x) {
    if (x == ar[x])
        return x;
    return ar[x] = get(ar[x]);
}
void merge(ll a ,ll b) {
    a = get(a);
    b = get(b);
    if (a == b) {
        return ;
    }
    ar[b] = ar[a];
 }

ll sev[100006];
vector<ll> pri;
void seive() {
    for(ll i = 2 ; i < 100006 ; i ++) {
        if (!sev[i]) {
            for(ll j = i ; j < 100006 ; j += i) {
                if(!sev[j])
                    sev[j] = i;
            }
        }
        if(sev[i] == i)
            pri.pb(i);
    }
}
 
 ll totient(ll n) {
     ll result = n;
     for(ll i = 2 ; i * i <= n ; i ++){
         if(n % i == 0){
             while(n % i == 0)
                 n /= i;
             result -= result / i;
         }
     }
     if(n > 1)
         result -= result / n;
     return result;
 }
 
 
 ll fen[N];
 void add(ll idx , ll val){
     idx ++;
     while(idx <= N){
         fen[idx] += val;
         idx += (idx & (-idx));
     }
 }
 ll query(ll idx){
     idx ++;
     ll sum = 0;
     while(idx > 0){
         sum += fen[idx];
         idx -= (idx & (-idx));
     }
     return sum;
 }
 
-----------------------------------------------------------------------------------------------------------------------*/


Measured memory_bytes: 384