/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author champon
 */

#include <iostream>
#include <fstream>

#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll = long long;
using ld = long double;
ll mod = ll(1e9)+7;
ll inf = ll(1e18);
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(a>b){a=b; return true;} return false; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T*)array, (T*)(array+N), val); }
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};

#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP

#include <iostream>
#include <vector>
#include <map>
using namespace std;

namespace dbg {
    using ll = long long;

    class Debug {
    public:
        Debug(){}
        template<typename T>
        void vd(vector<T> vec);
        template<typename T>
        void vd2(vector<vector<T>> vec);
        template<typename T>
        void ad(T *arr, ll n);
        template<typename T, size_t N>
        void ad2(T (&arr)[N], ll n);
        template<typename T>
        void md(T mp);
    };

    template<typename T>
    void Debug::vd(vector<T> vec) {
        for (auto vv : vec) cout << vv << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::vd2(vector<vector<T>> vec) {
        for (auto vv : vec) for (auto vvv : vv) cout << vvv << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::ad(T *arr, ll n) {
        for (int i = 0; i <= n; i++) cout << arr[i] << " ";
        cout << endl;
    }

    template<typename T, size_t N>
    void Debug::ad2(T (&arr)[N], ll n) {
        for (int i = 0; i <= N; i++) for (int j = 0; j <= n; j++) cout << arr[i][j] << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::md(T mp) {
        cout << "key : value" << endl;
        for (auto const &m : mp) cout << m.first << " : " << m.second << endl;
        cout << endl;
    }

}

#endif //INCLUDE_DEBUG_HPP

using dbg::Debug;
Debug debug;

class ARangeFlipFindRoute {
public:
	void solve(std::istream& in, std::ostream& out) {
	    int h, w;
	    in >> h >> w;
	    vector<vector<char>> g(h, vector<char>(w));
	    string s;
	    for(int i=0; i<h; i++){
	        in >> s;
	        for(int j=0; j<w; j++){
	            g[i][j] = s[j];
	        }
	    }

	    vector<vector<ll>> dp(h+1, vector<ll>(w+1, inf));
	    dp[0][0] = (g[0][0] == '#');
	    for(int i=0; i<h; i++){
	        for(int j=0; j<w; j++){
	            int r = 0, d = 0;
	            if(i+1 < h){
                    d = g[i+1][j] == '#' && g[i][j] != '#';
                    chmin(dp[i+1][j], dp[i][j] + d);
	            }
	            if(j+1 < w){
                    r = g[i][j+1] == '#' && g[i][j] != '#';
                    chmin(dp[i][j+1], dp[i][j] + r);
	            }
	        }
	    }

	    int r = 0, d = 0;
        d = g[h-1][w-1] == '#' && g[h-2][w-1] != '#';
	    r = g[h-1][w-1] == '#' && g[h-1][w-2] != '#';
	    chmin(dp[h-1][w-1], dp[h-2][w-1] + d);
	    chmin(dp[h-1][w-1], dp[h-1][w-2] + r);
//
//	    for(int i=0; i<h; i++){
//	        for(int j=0; j<w; j++){
//	            cout << dp[i][j] << " ";
//	        }
//	        cout << endl;
//	    }

	    out << dp[h-1][w-1] << endl;
	}
};


int main() {
	ARangeFlipFindRoute solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}


Measured memory_bytes: 384