Find the maximum of 3 numbers without branching This time around your goal is to find the maximum of 3 integers (from -(2^31) to 2^31 - 1 in binary 2's complement) without using branching or loops. 

You are only allowed to use


Inequality/Equality (==, &gt;, &gt;=, &lt;, &lt;=, !=) These count as 2 tokens.
Arithmetic (+, -, *, /)
Logical Operators (! not, &amp;&amp; and, ||  or) 
Bitwise Operators (~ not, &amp; and, | or, ^ xor, &lt;&lt;, &gt;&gt;, &gt;&gt;&gt; arithmetic and logical left and right shifts)
Constants. 0 tokens
Variable assignment. 0 tokens


Input 3 variables as a, b and c. Output the maximum number.

Standard atomic code-golf rules apply. If you have any questions please leave them in the comments. One token is any of the above with the special rules.
Javascript
6 tokens
function maxOf3(a, b, c) {
    (b&gt;a) &amp;&amp; (a=b);
    (c&gt;a) &amp;&amp; (a=c);
    return a;
}