#include <bits/stdc++.h>
using namespace std;
map<string, vector<int> > f;
map<string, int> cnt;
vector<int> solve(string s) {
  if (f.count(s)) return f[s];
  int i, j, k;
  string t;
  vector<int> ret;
  ret.resize(3, 0);
  for (i = 0; i < 26; i++)
    for (j = 0; j < 2; j++) {
      if (j)
        t = s + char('a' + i);
      else
        t = char('a' + i) + s;
      if (!cnt.count(t)) continue;
      int sc = cnt[t];
      int sum = 0, mx = 0;
      for (k = 0; k < t.size(); k++) {
        sum += t[k] - 'a' + 1;
        mx = max(mx, t[k] - 'a' + 1);
      }
      sc += sum * mx;
      vector<int> tmp = solve(t);
      tmp[0] ^= 1;
      tmp[1] = -tmp[1];
      tmp[2] = -tmp[2];
      swap(tmp[1], tmp[2]);
      tmp[1] += sc;
      if (tmp > ret) ret = tmp;
    }
  f[s] = ret;
  return ret;
}
int main() {
  int n, i, j, k;
  string s;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> s;
    set<string> vis;
    for (j = 0; j < s.size(); j++)
      for (k = 1; k < s.size() - j + 1; k++) vis.insert(s.substr(j, k));
    for (typeof(vis.begin()) itr = vis.begin(); itr != vis.end(); itr++)
      cnt[(*itr)]++;
  }
  vector<int> ans = solve("");
  if (ans[0] == 1)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  cout << ans[1] << ' ' << -ans[2] << endl;
}
