- Time limit: 1.00 s
- Memory limit: 512 MB
Input
The only input line has a string of length $n$. Each character is between a–z.
Output
First print an integer $k$: the number of strings. Then print $k$ lines: the strings in alphabetical order.
Constraints
- $1 \le n \le 8$
Input:
aabac
Output:
20
aaabc
aaacb
aabac
aabca
aacab
aacba
abaac
abaca
abcaa
acaab
acaba
acbaa
baaac
baaca
bacaa
bcaaa
caaab
caaba
cabaa
cbaaa