#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(char &c){
  int i;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c = i;
}
inline int rd(char c[]){
  int i;
  int sz = 0;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = my_getchar_unlocked();
    if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
      break;
    }
    c[sz++] = i;
  }
  c[sz]='\0';
  return sz;
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
template<class S, class T> inline S chmin(S &a, T b){
  if(a>b){
    a=b;
  }
  return a;
}
int X;
int Y;
char S[100][102];
int dp[100][100];
int main(){
  int i;
  rd(X);
  rd(Y);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(X);Lj4PdHRW++){
      rd(S[Lj4PdHRW]);
    }
  }
  for(i=(0);i<(X);i++){
    int j;
    for(j=(0);j<(Y);j++){
      dp[i][j] = 1073709056;
    }
  }
  if(S[0][0]=='.'){
    dp[0][0] =0;
  }
  else{
    dp[0][0] =1;
  }
  for(i=(0);i<(X);i++){
    int j;
    for(j=(0);j<(Y);j++){
      if(i+1 < X){
        if(S[i][j]=='.'&&S[i+1][j]=='#'){
          chmin(dp[i+1][j], dp[i][j] +1);
        }
        else{
          chmin(dp[i+1][j], dp[i][j] +0);
        }
      }
      if(j+1 < Y){
        if(S[i][j]=='.'&&S[i][j+1]=='#'){
          chmin(dp[i][j+1], dp[i][j] +1);
        }
        else{
          chmin(dp[i][j+1], dp[i][j] +0);
        }
      }
    }
  }
  wt_L(dp[X-1][Y-1]);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200325-1

// --- original code ---
// int X, Y;
// char S[100][102];
// int dp[100][100];
// {
//   rd(X,Y,S(X));
//   rep(i,X) rep(j,Y) dp[i][j] = int_inf;
//   dp[0][0] = if[S[0][0]=='.', 0, 1];
//   rep(i,X) rep(j,Y){
//     if(i+1 < X) dp[i+1][j] <?= dp[i][j] + if[S[i][j]=='.'&&S[i+1][j]=='#', 1, 0];
//     if(j+1 < Y) dp[i][j+1] <?= dp[i][j] + if[S[i][j]=='.'&&S[i][j+1]=='#', 1, 0];
//   }
//   wt(dp[X-1][Y-1]);
// }


Measured memory_bytes: 256