Uh oh, Someone at the office has dropped all these sequences on the floor and forgotten to label them with their correct bases. 

We have to fix this before the boss gets back or we're all going to be fired!

This is what your years of coding have been leading up to, now is your time to shine!

## Task

You will have to create a function which takes in a sequence of numbers in **random order** and you will have to return the correct base of those numbers.

The base is the number of unique digits. For example, a base 10 number can have 10 unique digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 and a base 2 number (Binary) can have 2 unique digits: 0 and 1.

### Constraints

The sequence will always be 10 numbers long and we know that the base is going to be between 2 and 10 inclusive so no need to worry about any letters. When sorted, the sequence is made up of consecutive numbers.

### Examples

```
[ "1", "2", "3", "4", "5", "6", "7", "8", "9", "10" ]     -->  10
[ "1", "2", "3", "4", "5", "6", "10", "11", "12", "13" ]  -->   7
```

**Good luck!**

Difficulty: EASY
Starter code: def base_finder(seq):
	

Solutions:
def base_finder(seq):
	return len(set(''.join(seq)))


def base_finder(a):
	return int(max((x[-1] for x in a))) + 1


def base_finder(seq):
	base = 0
	for i in range(10):
		number = seq[i]
		for i in range(len(number)):
			if int(number[i]) > base:
				base = int(number[i])
	return base + 1


def base_finder(seq):
	return int(max(''.join(seq))) + 1


base_finder = lambda _: int(max(map(lambda x: x[-1], _))) + 1


def base_finder(seq):
	digits = set((c for cs in seq for c in cs))
	return int(max(digits)) + 1


def base_finder(seq):
	a = []
	b = []
	for i in seq:
		for j in i:
			a.append(j)
	for digit in a:
		if digit not in b:
			b.append(digit)
	return len(b)


def base_finder(seq):
	str = ''
	for i in seq:
		str += i
	return len(set(str))


def base_finder(seq):
	return max([int(i) for i in ''.join(seq)]) + 1


def base_finder(seq):
	mx = [int(char) for char in seq]
	mx = sorted(mx)
	print(mx)
	for i in range(min(mx), max(mx)):
		if i not in mx:
			return int(str(i)[-1])
	return len(mx)