#include <bits/stdc++.h>
using namespace std;
int n, m;
set<string> subWords;
map<string, int> countMp;
class TT {
 public:
  int w = 1;
  int p[2] = {0, 0};
  bool operator>(const TT other) {
    if (w != other.w) {
      return w < other.w;
    }
    if (p[w] != other.p[w]) {
      return p[w] > other.p[w];
    }
    return p[1 - w] < other.p[1 - w];
  };
};
map<string, TT> cacheResult;
int gp(string s) {
  int ma = -1, sum = 0;
  for (int i = 0; i < s.size(); i++) {
    int a = int(s[i] - 'a') + 1;
    ma = max(ma, a);
    sum += a;
  }
  return sum * ma + countMp[s];
}
TT deal(string s) {
  if (cacheResult.find(s) != cacheResult.end()) {
    return cacheResult[s];
  }
  TT *ans = new TT();
  for (int i = 0; i < 26; i++) {
    string news = s + (char)('a' + i);
    if (subWords.find(news) != subWords.end()) {
      TT tmp = deal(news);
      tmp.w = 1 - tmp.w;
      tmp.p[tmp.w] += gp(news);
      if (tmp > *ans) *ans = tmp;
    }
    news = (char)('a' + i) + s;
    if (subWords.find(news) != subWords.end()) {
      TT tmp = deal(news);
      tmp.w = 1 - tmp.w;
      tmp.p[tmp.w] += gp(news);
      if (tmp > *ans) *ans = tmp;
    }
  }
  return cacheResult[s] = *ans;
}
int main() {
  map<string, int>::iterator iter;
  string s;
  while (~scanf("%d", &n)) {
    for (int k = 0; k < n; k++) {
      cin >> s;
      set<string> checkSubs;
      int size = s.length();
      for (int i = 0; i < size; i++) {
        for (int j = i; j < size; j++) {
          string sub = s.substr(i, j - i + 1);
          subWords.insert(sub);
          if (checkSubs.find(sub) == checkSubs.end()) {
            checkSubs.insert(sub);
            iter = countMp.find(sub);
            if (iter == countMp.end()) {
              countMp.insert(make_pair(sub, 1));
            } else {
              countMp[sub] = iter->second + 1;
            }
          }
        }
      }
    }
    TT ans = deal("");
    if (ans.w == 0)
      printf("First\n");
    else
      printf("Second\n");
    printf("%d %d\n", ans.p[ans.w], ans.p[1 - ans.w]);
  }
  return 0;
}
