记录

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll N=1e6+10;
ll n,a[N],b[N],sum=0,maxn=0;
ll read(){
	ll ret=0,f=1;char ch=getchar();
	while (!isdigit(ch)) {if (ch=='-')f=-f;ch=getchar();}
	while (isdigit(ch)) ret=(ret<<3)+(ret<<1)+(ch&15)/* ret=ret*10+ch-'0，*/,ch=getchar();
	return ret*f;
}
int main(){
	n=read();
	for(ll i=1;i<=n;i++)a[i]=read();
	for(ll i=1;i<=n;i++)b[i]=read();
	for(ll i=1;i<=n;i++){
		if(a[i]>b[i])sum++;
		else if(a[i]<b[i])maxn++;
		else if(a[i]==b[i])continue;
	}
	if(sum<maxn)printf("%lld %lld\nQ",sum,maxn);
	else if(sum>maxn)printf("%lld %lld\nS",sum,maxn);
	else if(sum==maxn)printf("%lld %lld\nTie",sum,maxn);
	return 0;
}