Оптимизировать логическое выражение?

    public static bool IsAllowed(int a, int b, int c) => 
            (a == 1 || b == 1 || c == 1)
        && !(a == 2 || b == 2 || c == 2);

if ((a < 1 && b < 1 && c < 1) || (a > 1 && b > 1 && c > 1)) return false;

public static bool IsAllowed(int a, int b, int c) => (a+b+c== 1);

new Neko1().Nya();
Console.WriteLine();
new Neko2().Nya();
 
class Neko1
{
    public void Nya()
    {
        Inner();
    }
 
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    private void Inner()
    {
        var current = Environment.StackTrace;
        Console.WriteLine(current);
    }
}
 
class Neko2
{
    public void Nya()
    {
        Inner();
    }
 
    [MethodImpl(MethodImplOptions.NoInlining)]
    private void Inner()
    {
        var current = Environment.StackTrace;
        Console.WriteLine(current);
    }
}

using System.Runtime.CompilerServices;
 
Console.WriteLine(Find());
 
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
static bool Find()
{
   return true;
}