Two sum in Python: Based on array of different integers (ints) and a single  integer (target), write function to print count/amount of combinations (non-repeating) of pairs of integers in (ints) such that the two integers sum to (target).

Starting with:

def twosum (ints, target):

I'm not sure how to make it so the code returns the amount of combinations instead of printing the viable indices