#include <bits/stdc++.h>

#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(a) a.begin(),a.end()
#define pb push_back
#define LSOne(S) (S & (-S))

typedef unsigned long long llu;
typedef long long ll;
typedef long double ld;

const int INF = 0x3f3f3f3f;

using namespace std;

int main(){
  int l;
  while(scanf("%d%*c", &l) && l){
  	char c;
  	int res = INF, d = -1, r = -1;
  	REP(i, l){
  		scanf("%c", &c);
  		if(c == 'R'){
  			r = i;
  			if(d != -1) res = min(res, abs(r-d));
  		} else if(c == 'D'){
  			d = i;
  			if(r != -1) res = min(res, abs(r-d));
  		} else if(c == 'Z') res = 0;
  	}
  	if(d != -1 && r != -1) res = min(res, abs(r-d));
  	cout << res << endl;
  }
  return 0;
}

#include <bits/stdc++.h>

#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(a) a.begin(),a.end()
#define pb push_back
#define LSOne(S) (S & (-S))

typedef unsigned long long llu;
typedef long long ll;
typedef long double ld;

const int INF = 0x3f3f3f3f;

using namespace std;

int main(){
  int a, c;
  while(scanf("%d", &a) && a){
    scanf("%d", &c);
    int v[c], cnt = 0;
    REP(i, c) scanf("%d", &v[i]);
    REP(i, c){
	    if(i) {
		    if(v[i] < v[i-1]) cnt += abs(v[i]-v[i-1]);
	    } else cnt += abs(a-v[i]);
    }
    cout << cnt << endl;
  }
  return 0;
}

#include <bits/stdc++.h>
#define NMAX 18
#define ll long long
using namespace std;

int v[NMAX+1];

int main() {
   int n, _case = 1;
   
   while( ~scanf( "%d", &n ) && n ) {
      for( int i = 0; i < n; i++ )
         scanf( "%d", &v[i] );
      
      ll maxp = 0;
      for( int i = 1; i <= n; i++ ) {
         for( int j = 0; j < n; j++ ) {
            ll p = 1;
            for( int k = j; k < j + i && k < n; k++ )
               p *= v[k];
            maxp = max( maxp, p );
         }
      }
   
      printf( "Case #%d: The maximum product is %Ld.\n\n", _case++, maxp );
   }

   return 0;
}