Noah's (upgraded) ark As preparation for the nth Exodus, Noah decides to write a program that will decide If he will let animals on his ark.  However, Noah wants to go back to grass roots. Thus he decides that the program should be as small and as simple as possible.
GOAL:
Recreate the Contrabulous Choosematron, in a way that follows evangelical stories.
INPUT:
The program is simple, and elegant, and takes in 2 inputs:
The species of animal [String]
and The animal's gender [boolean]
OUTPUT:
The program then puts out Either 'Y' or 'N', Which determines whether or not the given  animal is allowed onto the ark.
RULES:
Only one Animal of each species and gender is allowed on the ark. No more.
Your output can be any set of boolean values (true false, yes no, y n, yin yang) so long as they're easily distinguishable.
If your program should want to accept a list of input, rather than use STDIN, that's fine. However, each output has to be in corresponding order of the input (FIFO), as well as be in the exact same format as the input.
This is a golf, so the lowest byte count wins, good luck!!!!
EXAMPLE:

&quot;Monkey&quot; true&lt;
y
&quot;Monkey&quot; false&lt;
y
&quot;Monkey&quot; false&lt;
n
&quot;Monkey with symbols&quot; false&lt;
y
&quot;monkey&quot; true&lt;
n

This is valid, as your program doesn't need to distinguish that Monkey, and monkey with symbols are the same thing species, however, Monkey and monkey are very much the same thing, and so the last critter would be denied.
Python 2, 72 bytes

Takes input as a list of strings of the form "animalname T". The idea is it just uses each string as an identifier and should only print true if the string has not occurred in the list so far.

def f(l):k=map(str.lower,l);print[j not in k[:i]for i,j in enumerate(k)]


Try it here!