/*
Problem from CodeForces!

#2B The Least Round Way

Tags: ["DP" : "Math" : "2000"]

Link: https://codeforces.me/contest/2/problem/B
*/

/*
	Written by: Aryan V S
	Date: Tuesday 2020-03-24
*/

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define all(x)  x.begin (), x.end ()
#define rall(x) x.rbegin (), x.rend ()
template <typename T> ostream& operator << (ostream& Stream, const vector <T>& Vec)
{ for (const T& i : Vec) Stream << i << " "; return Stream; }
template <typename A, typename B> ostream& operator << (ostream& Stream, const pair <A, B>& Pair)
{ return Stream << Pair.first << ' ' << Pair.second; }
#ifdef Z_LOCAL
#define Debug(VarArgs...)                                                \
do { string Str = #VarArgs; replace (all (Str), ',', ' ');               \
	 stringstream SS (Str); istream_iterator<std::string> Iterator (SS); \
     Error (Iterator, VarArgs); } while (false);
void Error (istream_iterator <string> Iterator) {}
template <typename T, typename... Args> void Error
(istream_iterator <string> Iterator, const T& Var, Args... ExtraArgs)
{ cout << "\nValues of \"" << *Iterator << "\": " << Var << endl; Error (++Iterator , ExtraArgs...); }
class Timer { private: chrono::time_point <chrono::steady_clock> Begin, End; public: Timer () : Begin(), End ()
{ Begin = chrono::steady_clock::now(); } ~Timer () { End = chrono::steady_clock::now(); chrono::duration <double>
Duration = End - Begin; cout << "\nDuration: " << ((chrono::duration <double>)(End - Begin)).count() << "s\n"; } } T;
#else
#define Debug(VarArgs...) do {} while (false);
#endif

int Get2 (ull N) {
	int two = 0;
	while (N % 2 == 0) {
		two++;
		N /= 2;
	}
	return two;
}

int Get5 (ull N) {
	int five = 0;
	while (N % 5 == 0) {
		five++;
		N /= 5;
	}
	return five;
}

int main() {
	ios::sync_with_stdio (false);
	cin.tie (nullptr); cout.tie (nullptr);
	cout.precision (10);
	cout << fixed;// << boolalpha;

	int N, Zero_idx = 0; cin >> N;
	vector <vector <int>> dp2 (N, vector <int> (N));
	vector <vector <int>> dp5 (N, vector <int> (N));
	bool Zero = false;
	for (int i = 0; i < N; ++i)
		for (int j = 0; j < N; ++j) {
			ull X; cin >> X;
			if (X == 0) {
				Zero = true;
				Zero_idx = j;
				continue;
			}
			dp2 [i][j] = Get2(X);
			dp5 [i][j] = Get5(X);
			if (i >= 1 && j >= 1) {
				dp2 [i][j] += min(dp2 [i - 1][j], dp2 [i][j - 1]);
				dp5 [i][j] += min(dp5 [i - 1][j], dp5 [i][j - 1]);
			}
			else if (i >= 1) {
				dp2 [i][j] += dp2 [i - 1][j];
				dp5 [i][j] += dp5 [i - 1][j];
			}
			else if (j >= 1) {
				dp2 [i][j] += dp2 [i][j - 1];
				dp5 [i][j] += dp5 [i][j - 1];
			}
		}

//	for (int i = 0; i < N; ++i) {
//		for (int j = 0; j < N; ++j)
//			cout << dp2 [i][j] << " ";
//		cout << '\n';
//	}
//
//	for (int i = 0; i < N; ++i) {
//		for (int j = 0; j < N; ++j)
//			cout << dp5 [i][j] << " ";
//		cout << '\n';
//	}

	int best = min(dp2 [N - 1][N - 1], dp5 [N - 1][N - 1]);
	string Answer;
	if (Zero && best > 1) {
		best = 1;
		for (int i = 0; i < Zero_idx; ++i) Answer += 'R';
		for (int i = 0; i < N - 1; ++i) Answer += 'D';
		for (int i = Zero_idx; i < N - 1; ++i) Answer += 'R';
	}
	else {
		auto Path_Finder = [&] (const vector <vector <int>>& dp) -> string {
			int Row = N - 1, Col = N - 1;
			string Path;
			while (Row >= 1 || Col >= 1) {
				if (Row >= 1 && Col >= 1) {
					if (dp [Row - 1][Col] > dp [Row][Col - 1]) {
						Path = 'R' + Path;
						Col--;
					}
					else {
						Path = 'D' + Path;
						Row--;
					}
				}
				else if (Row >= 1)
					while (Row >= 1) {
						Path = 'D' + Path;
						Row--;
					}
				else
					while (Col >= 1) {
						Path = 'R' + Path;
						Col--;
					}
			}
			return Path;
		};
		if (best == dp2 [N - 1][N - 1])
			Answer = Path_Finder (dp2);
		else
			Answer = Path_Finder (dp5);
	}

	cout << best << '\n' << Answer;

	return 0;
}