#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int> 
#define pdd pair<double,double>
#define ll long long

#define PI 2*acos(0.0)
#define EPS 1e-9
#define INF 1000000000

using namespace std;

int T, N;
char path[50050];

int main()
{
	scanf("%d", &T);
	for(int t = 1; t <= T; t++) {
		scanf("%d", &N);
		scanf("%s", path);
		for(int i = 0, len = strlen(path); i < len; i++) {
			if(path[i] == 'S') path[i] = 'E'; else path[i] = 'S';
		}

		printf("Case #%d: %s\n", t, path);
	}
	return 0;
}
