#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main(){
    int n;
    cin >> n;
    vector<ll> data(n);
    rep(i,0,n){
        cin >> data[i];
    }
    ll m=0;
    ll y=0;
    ll t=0;
    rep(i,0,n){
        m += abs(data[i]);
        y += pow(data[i],2);
        if(t<abs(data[i])){
            t = abs(data[i]);
        }
    }
    double ans  = sqrt(y);
    cout << std::setprecision(15) << m <<endl;
    cout << std::setprecision(15) << ans <<endl;
    cout << std::setprecision(15) << t << endl;
    // cout << m << endl;
    // cout<< y <<endl;
    // cout<<t << endl;
    return 0;

}

#include <cstdio>
#include <cstring>
#include <algorithm>
#define rep(a,b,c) for(int a=b;a<=c;a++)
const int p=3;
const int N=4e5+5;
int fac[4],inv[4];
inline int C(int n,int m) { return (n>=m)?(1ll*fac[n]*inv[m]*inv[n-m]%p):0; }
inline int lucas(int n,int m) {
	if(!m) return 1;
	return 1ll*C(n%p,m%p)*lucas(n/p,m/p)%p;
}
int n,ans;
char s[N];
inline int get(char S) {
	if(S=='B') return 0;
	else if(S=='W') return 1;
	else return 2;
}
int main() {
	fac[0]=1; inv[0]=1; fac[1]=1; inv[1]=1; fac[2]=2; inv[2]=2;
	scanf("%d",&n);
	scanf("%s",s+1);
	rep(i,1,n) (ans+=lucas(n-1,i-1)*get(s[i]))%=p;
	if(!(n&1)) ans=(3-ans)%p;
	if(ans==0) putchar('B');
	if(ans==1) putchar('W');
	if(ans==2) putchar('R');
}