#!/usr/bin/python

def permutation( s ):
	if(len(s) == 0):
		return [s]
	else:
		result = []
		ss = s[:]
		for i in range(len(ss)):
			rest = ss[:]
			rest.remove(ss[i])
			tmp = permutation(rest)
			for e in tmp:
				e.insert( 0, ss[i] )
				result.append( e )
		return result