Very simple, given a number, find its opposite.

Examples:
```
1: -1
14: -14
-34: 34
```

~~~if:sql
You will be given a table: `opposite`, with a column: `number`. Return a table with a column: `res`.
~~~

Difficulty: EASY
Tags: Fundamentals

Starter code:
def opposite(number):
	

Solutions:
def opposite(number):
	return -number


def opposite(number):
	return number * -1


def opposite(number):
	return number - number * 2


def opposite(number):
	if type(number) is int or type(number) is float or type(number) is complex:
		number = number * -1
		return number
	else:
		try:
			number = complex(number) * -1
			return number
		except ValueError:
			print('Input data cannot be represented as a number')
			return None


from operator import neg as opposite


opposite = lambda x: -x


opposite = lambda n: -n


def opposite(number):
	return abs(number) if number < 0 else 0 - number


def opposite(number):
	numbers = str(number)
	if isinstance(number, int):
		if numbers[0] == '-':
			negatives = numbers[1:]
			negative = int(negatives)
			return negative
		else:
			positives = '-' + numbers
			positive = int(positives)
			return positive
	if isinstance(number, float):
		if numbers[0] == '-':
			negatives = numbers[1:]
			negative = float(negatives)
			return negative
		else:
			positives = '-' + numbers
			positive = float(positives)
			return positive


def opposite(n):
	return -1 * n


def opposite(number):
	return number * 'Magic Forest'.find('unicorn')


def opposite(n):
	return -n


def opposite(number):
	return 0 - number


def opposite(number):
	if number > 0:
		return number - number - number
	elif number < 0:
		return number - number - number
	else:
		return number


def opposite(number):
	opposite = lambda x: -x
	result = opposite(number)
	return result


def opposite(x):
	return x * -1


opposite = lambda n: n * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1)) * (n - (n + 1)) / (n - (n + 1))


def opposite(number):
	import re
	m = re.match('-', str(number))
	if m:
		number = re.sub('-', '', str(number))
	else:
		number = '-' + str(number)
	try:
		return int(number)
	except ValueError:
		return float(number)


def opposite(number):
	return (lambda x: x * -1)(number)


opposite = 0.0.__sub__


def opposite(n):
	str = '\n    ────────▓▓▓▓▓▓▓────────────▒▒▒▒▒▒\n──────▓▓▒▒▒▒▒▒▒▓▓────────▒▒░░░░░░▒▒\n────▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓────▒▒░░░░░░░░░▒▒▒\n───▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒░░░░░░░░░░░░░░▒\n──▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░▒\n──▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░▒\n─▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░░▒\n▓▓▒▒▒▒▒▒░░░░░░░░░░░▒▒░░▒▒▒▒▒▒▒▒▒▒▒░░░░░░▒\n▓▓▒▒▒▒▒▒▀▀▀▀▀███▄▄▒▒▒░░░▄▄▄██▀▀▀▀▀░░░░░░▒\n▓▓▒▒▒▒▒▒▒▄▀████▀███▄▒░▄████▀████▄░░░░░░░▒\n▓▓▒▒▒▒▒▒█──▀█████▀─▌▒░▐──▀█████▀─█░░░░░░▒\n▓▓▒▒▒▒▒▒▒▀▄▄▄▄▄▄▄▄▀▒▒░░▀▄▄▄▄▄▄▄▄▀░░░░░░░▒\n─▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░▒\n──▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░▒\n───▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▀▀▀░░░░░░░░░░░░░░▒\n────▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░▒▒\n─────▓▓▒▒▒▒▒▒▒▒▒▒▄▄▄▄▄▄▄▄▄░░░░░░░░▒▒\n──────▓▓▒▒▒▒▒▒▒▄▀▀▀▀▀▀▀▀▀▀▀▄░░░░░▒▒\n───────▓▓▒▒▒▒▒▀▒▒▒▒▒▒░░░░░░░▀░░░▒▒\n────────▓▓▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░▒▒\n──────────▓▓▒▒▒▒▒▒▒▒▒░░░░░░░░▒▒\n───────────▓▓▒▒▒▒▒▒▒▒░░░░░░░▒▒\n─────────────▓▓▒▒▒▒▒▒░░░░░▒▒\n───────────────▓▓▒▒▒▒░░░░▒▒\n────────────────▓▓▒▒▒░░░▒▒\n──────────────────▓▓▒░▒▒\n───────────────────▓▒░▒\n────────────────────▓▒\n'
	return str.find('¯\\_(ツ)_/¯') * n


opposite = lambda number: -number


def opposite(number):
	return float(('-' + str(number)).replace('--', ''))


def opposite(number):
	return (~int(number) + int(number)) * number


def opposite(number):
	answer = 0 - number
	return answer


opposite = lambda l: -l


def opposite(number):
	oppositenum = -number
	return oppositenum


def opposite(number):
	if number <= 0:
		return abs(number)
	else:
		return number - 2 * number
opposite(1)


def opposite(number):
	return -1 * number
print((1, 14, -34))


def opposite(number):
	float(number)
	if number > 0:
		return number - number * 2
	elif number < 0:
		return abs(number)
	elif number == 0:
		return 0


def opposite(number):
	if number != 0:
		result = -number
	else:
		result = 0
	return result


def opposite(number):
	reverse = number - number - number
	print(reverse)
	return reverse
n = opposite(5)


def opposite(number):
	if number >= 0:
		return -number
	else:
		return number + -number * 2


def opposite(number):
	a = -1
	c = number * a
	return c


def opposite(number):
	if '-' in str(number):
		return -number
	else:
		return -number


def opposite(number):
	new_num = number
	if number <= 0:
		neg_num = number * 2
		neg_num2 = new_num - neg_num
		return neg_num2
	elif number >= 0:
		pos_num = number * 2
		pos_num2 = new_num - pos_num
		return pos_num2


def opposite(number):
	a = float(number) * -1
	return a


def opposite(number):
	if number >= 0:
		return float('-' + str(number))
	else:
		return float(str(number)[1:])


def opposite(number):
	out = number * -1
	return out


def opposite(a):
	return -1 * a


def opposite(number):
	if number >= 0:
		return -number
	else:
		return number * -1


def opposite(number):
	output = 0 - number
	return output


def opposite(number):
	x = '-' + str(number)
	if number < 0:
		return abs(number)
	else:
		return float(x)


def opposite(number):
	qwe = number * -1
	return qwe


def opposite(number):
	number *= -1
	return number
n = 5
print(opposite(n))


def opposite(number):
	number = -number
	return number
print(opposite(1))


def opposite(n):
	e = n - (n + n)
	return e


import numpy

def opposite(number):
	if number < 0:
		return abs(number)
	else:
		return numpy.negative(number)


def opposite(number):
	return number - number * 2
opposite(8)


def opposite(num):
	return abs(num) if num < 0 else -abs(num)


def opposite(number):
	answer = number * -1
	return answer


def opposite(number):
	opacne = number * -1
	return opacne


def opposite(number):
	num = number - 2 * number
	return num


def opposite(number):
	w = -number
	return w


def opposite(number):
	return number * -1
a = opposite(-10)
print(a)


def opposite(number):
	string = str(number)
	if string[0] == '-':
		return float(string[1:])
	else:
		return float(''.join(['-', string]))


def opposite(number):
	convert = None
	if number < 0:
		convert = str(number)[1:]
	else:
		convert = '-' + str(number)
	try:
		return int(convert)
	except:
		return float(convert)


def opposite(number):
	tmp = number * 2
	ans = number - tmp
	return ans


def opposite(value):
	return value * -1


def opposite(number):
	absolu = number * -1
	return absolu


def opposite(number):
	rev = 0
	rev = -1 * number
	return rev


def opposite(n):
	if n > 0:
		n = n - 2 * n
		return n
	else:
		n = abs(n)
		return n


def opposite(number):
	if number >= 1:
		tempnum = number + number
		result = number - tempnum
		return result
	if number <= -1:
		tempnum = number + number
		result = number - tempnum
		return result
	else:
		return 0


def opposite(number):
	return -number if number != -number else number


def opposite(number):
	x = number = -number
	return x


def opposite(number):
	output_num = number * -1
	return output_num


def opposite(N):
	return -N


def opposite(number):
	if number > 0:
		number = 0 - number
	elif number is None:
		number = -1
	else:
		return abs(number)
	return number


def opposite(number):
	if number < 0:
		return abs(number)
	if number > 0:
		return float('-' + str(number))
	if number == 0:
		return 0