#include <bits/stdc++.h>
using namespace std;
map<string, pair<int, pair<int, int> > > dp;
int n;
string s[30];
pair<int, pair<int, int> > rec(string str) {
  if (dp.count(str)) return dp[str];
  pair<int, pair<int, int> > ret = make_pair(-1, make_pair(0, 0));
  for (char c = 'a'; c <= 'z'; c++)
    for (int p = 0; p < 2; p++) {
      string nxt = p ? c + str : str + c;
      int sum = 0, mx = 0, cnt = 0;
      for (int i = 0; i < nxt.size(); i++) {
        sum += nxt[i] - 'a' + 1;
        mx = max(mx, nxt[i] - 'a' + 1);
      }
      for (int i = 0; i < n; i++)
        if (s[i].find(nxt) != s[i].npos) cnt++;
      if (cnt == 0) continue;
      int score = sum * mx + cnt;
      pair<int, pair<int, int> > tmp = rec(nxt);
      ret = max(ret,
                make_pair(tmp.first * -1, make_pair(score - tmp.second.second,
                                                    -tmp.second.first)));
    }
  return dp[str] = ret;
}
void run() {
  dp.clear();
  cin >> n;
  for (int i = 0; i < n; i++) cin >> s[i];
  pair<int, pair<int, int> > ans = rec("");
  cout << (ans.first > 0 ? "First" : "Second") << endl;
  cout << ans.second.first << " " << -ans.second.second << endl;
}
int main() {
  run();
  return 0;
}
