<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def n_queens(queen_count):
 """N-Queens solver. Args: queen_count: the number of queens to solve for. This is also the board size. Yields: Solutions to the problem. Each yielded value is looks like queen, and the index into the tuple indicates the row. """

    out =list()
    cols = range(queen_count)
    #for vec in permutations(cols):
    for vec in permutations(cols,None):
        if (queen_count == len(set(vec[i]+i for i in cols))
                        == len(set(vec[i]-i for i in cols))):
            #yield vec
            out.append(vec)
    return out