#include <bits/stdc++.h>
using namespace std;
map<string, long long> freq;
long long cal(const string &s) {
  long long mx = 0, sum = 0;
  for (long long i = (0); i < (s.length()); i++) {
    mx = max(mx, s[i] - 'a' + 1ll);
    sum += s[i] - 'a' + 1;
  }
  return mx * sum + freq[s];
}
void solve() {
  long long n;
  cin >> n;
  string s[n];
  for (long long i = (0); i < (n); i++) cin >> s[i];
  map<string, pair<long long, pair<long long, long long> > > subs[31];
  for (long long i = (1); i < (31); i++) {
    for (long long j = (0); j < (n); j++) {
      for (long long k = (0); k < ((long long)s[j].size() - i + 1); k++) {
        string t = s[j].substr(k, i);
        subs[i][t] = make_pair(-1ll, make_pair(-1ll, -1ll));
      }
    }
  }
  for (long long i = (1); i < (31); i++) {
    for (decltype((subs[i]).begin()) it = (subs[i]).begin();
         it != (subs[i]).end(); it++) {
      for (long long i = (0); i < (n); i++) {
        if (s[i].find(it->first) != string::npos) freq[it->first]++;
      }
    }
  }
  string emp = "";
  subs[0].insert(make_pair(emp, make_pair(-1ll, make_pair(-1ll, -1ll))));
  for (long long i = (30); i > (-1); i--) {
    for (decltype((subs[i]).begin()) it = (subs[i]).begin();
         it != (subs[i]).end(); it++) {
      string t = it->first;
      if (i != 30) {
        for (decltype((subs[i + 1]).begin()) jt = (subs[i + 1]).begin();
             jt != (subs[i + 1]).end(); jt++) {
          if (jt->first.find(t) != string::npos) {
            long long win, mx1, mx2;
            long long add = cal(jt->first);
            if (jt->first.size() % 2) {
              win = jt->second.first;
              mx1 = jt->second.second.first + add;
              mx2 = jt->second.second.second;
              bool flag = 0;
              if (win == 0) {
                if (it->second.first != 0)
                  it->second = make_pair(win, make_pair(mx1, mx2));
                else if (mx1 > it->second.second.first)
                  it->second = make_pair(win, make_pair(mx1, mx2));
                else if (mx1 == it->second.second.first &&
                         mx2 < it->second.second.second)
                  it->second = make_pair(win, make_pair(mx1, mx2));
              } else if (it->second.first != 0) {
                if (it->second.first == -1)
                  it->second = make_pair(win, make_pair(mx1, mx2));
                else if (mx1 > it->second.second.first)
                  it->second = make_pair(win, make_pair(mx1, mx2));
                else if (mx1 == it->second.second.first &&
                         mx2 < it->second.second.second)
                  it->second = make_pair(win, make_pair(mx1, mx2));
              }
            } else {
              win = jt->second.first;
              mx1 = jt->second.second.first;
              mx2 = jt->second.second.second + add;
              if (win == 1) {
                if (it->second.first != 1)
                  it->second = make_pair(win, make_pair(mx1, mx2));
                else if (mx2 > it->second.second.second)
                  it->second = make_pair(win, make_pair(mx1, mx2));
                else if (mx2 == it->second.second.second &&
                         mx1 < it->second.second.first)
                  it->second = make_pair(win, make_pair(mx1, mx2));
              } else if (it->second.first != 1) {
                if (it->second.first == -1)
                  it->second = make_pair(win, make_pair(mx1, mx2));
                else if (mx2 > it->second.second.second)
                  it->second = make_pair(win, make_pair(mx1, mx2));
                else if (mx2 == it->second.second.second &&
                         mx1 < it->second.second.first)
                  it->second = make_pair(win, make_pair(mx1, mx2));
              }
            }
          }
        }
      }
      if (it->second.first == -1)
        it->second = make_pair(1 - it->first.size() % 2, make_pair(0ll, 0ll));
    }
  }
  auto ans = *(subs[0].begin());
  cout << (ans.second.first == 0 ? "First\n" : "Second\n")
       << ans.second.second.first << " " << ans.second.second.second << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  for (long long i = (1); i < (t + 1); i++) {
    solve();
    cout << "\n";
  }
}
