import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	public static void main(String[] args) {
		solve();
	}
	
	public static void solve() {
		IO io = new IO();
		int n = io.nextInt();
		int[] a = io.nextIntArray(n);
		System.out.println(fast(n,a) ? "First" : "Second");
	}
	
	public static boolean tle(int n,int[] a) {
		Arrays.sort(a);
		int[] b = new int[n];
		int i = n - 1;
		while(i >= 0) {
			int j = i;
			while(j > 0 && a[j] == a[j-1]) {
				j--;
			}
			for(int k=0;j+k<=i;k++) {
				b[j+k] = k % 2;
			}
			for(int k=i+1;k<n;k++) {
				if (b[k-1] != 0 && b[k] != 0) {
					b[k] = 0;
				}else if(b[k-1] != 1 && b[k] != 1) {
					b[k] = 1;
				}else{
					b[k] = 2;
				}
			}
			int slide = a[j] - (j == 0 ? 0 : a[j-1]) - 1;
			for(int k=n-1;k>=j;k--) {
				if (k - slide >= j) {
					b[k] = b[k-slide];
				}else{
					b[k] = ((k - j - slide) % 2 + 2) % 2;
				}
			}
			i = j - 1;
		}
		return b[n-1] != 0;
	}
	
	public static boolean fast(int n,int[] a) {
		Arrays.sort(a); //危ない
		int i = 0;
		while(i < n) {
			int j = i;
			while(j < n - 1 && a[j] == a[j+1]) {
				j++;
			}
			int y1 = n - i;
			if (y1 <= a[i]) {
				return mod2(a[i] - y1) != 0;
			}
			int x1 = n - a[i];
			if (x1 <= j) {
				return mod2(x1 - i) != 0;
			}
			if (x1 == j + 1) {
				int left = mod2(x1 - 1 - i);
				int top  = mod2(a[i] + 1 - a[j+1]);
				if (left != 0 && top != 0) {
					return false;
				}else{
					return true;
				}
			}
			i = j + 1;
		}
		//?????
		return false;
	}
	
	public static int mod2(int x) {
		return ((x % 2) + 2) % 2;
	}

}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}



Measured memory_bytes: 12168