Proportion of strings with ascending letters Challenge


Construct n strings, each with three distinct letters, chosen randomly with equal probability.
Print the proportion k/n where k is the number of strings such that all three characters are in ascending order. Print also those k strings.


Input


The only input is n (and thus it must be a positive integer).


Outputs


The proportion k/n must be truncated to two decimal places.
The strings that are in ascending order of letters.


Requirements


The letters must come from the English alphabet.
You cannot print the value of k.


Examples


Input: 6, Output: 0.16 agh
Input: 1, Output: 1.00 suv
Input: 9, Output: 0.22 hls jqr


How to Win


Fewest number of bytes wins.
Jelly, 31 bytes

13 bytes to cater for the truncation requirement!

ØaẊ⁸Ð¡Ḋḣ€3ṢƑƇðL÷+⁵×ȷ2ḞṾs2j”.Ḋṭ⁸


A monadic link which, given an integer, yields a list.

Try it online! (footer joins the list with spaces)



If (1) we remove the truncation requirement and (2) "The letters must come from the English alphabet" implies that we may choose any subset of three or more such letters then this 16 works:

“ḃ»Ẋ⁸Ð¡⁼ƇḢ$ðL÷;⁸


Try this one (only uses A, B, and C)



If we may also avoid the unobservable creation of all the strings as part of of our code. then this 15 works:

6ẋX€ỊƇ“ḃ»ẋðL÷;⁸


Try this one (only uses A, B, and C, and does not create any unordered strings)