An ordinary cubical dice having six faces marked with alphabets A, B, C, D, E, and F is thrown `n` times and the list of `n` alphabets showing up are noted. Find the total number of ways in which among the alphabets A, B, C D, E and F only three of them appear in the list.