This continues Damiano's puzzle "Four dice puzzle: 2,2,4,5"
Damiano keeps throwing his four dice. After a lot of throwing and thinking and working, he has determined for every throw $a,b,c,d$ of his four dice the smallest positive integer $N(a,b,c,d)$ that cannot be generated from this throw according to the following rules:
- One may use the four numbers $a,b,c,d$ in any order, and it is fine if not all of them are used.
- Concatenation of digits is NOT allowed.
- The only allowed operations are additions, subtraction, multiplication, and division ($+,-,*,/$).
- One may use any number of brackets.
Question: Which throw $a,b,c,d$ of dice yields the largest number $N(a,b,c,d)$ ?