import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readA(T)(size_t n,ref T[]t){t=new T[](n);auto r=rdsp;foreach(ref v;t)pick(r,v);}

const g = "011203110332240522330113021104527401120311033224455233011302110453748112031103322445593301130211045374".
  map!(gi => cast(int)(gi-'0')).array;

void main()
{
  int n; readV(n);
  int[] a; readA(n, a);

  auto grundy(int c)
  {
    return c < 68 ? g[c] : g[68+c%34];
  }

  a.sort();
  foreach (i; 0..n) a[i] -= i;
  writeln(a.group.map!"a[1]".map!(ci => grundy(ci.to!int)).reduce!"a^b" == 0 ? "Second" : "First");
}