#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;
string C;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	int ret=0;
	FOR(i,N) {
		cin>>C;
		x=y=0;
		string V="S";
		FORR(c,C) {
			if(c=='L') {
				x-=2;
				if(x==0||x==-2) {
					if(V.back()=='R') V.pop_back();
					else V.push_back('L');
				}
			}
			if(c=='R') {
				x+=2;
				if(x==0||x==2) {
					if(V.back()=='L') V.pop_back();
					else V.push_back('R');
				}
			}
			if(c=='U') {
				y+=2;
				if(y==2) {
					if(V.back()=='D') V.pop_back();
					else V.push_back('U');
				}
			}
			if(c=='D') {
				y-=2;
				if(y==0) {
					if(V.back()=='U') V.pop_back();
					else V.push_back('D');
				}
			}
		}
		if(V.size()==1) ret++;
	}
	cout<<ret<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}