// 
// Decompiled by Procyon v0.6.0
// 

package org.bouncycastle.pqc.crypto.mldsa;

class Reduce
{
    static int montgomeryReduce(final long n) {
        return (int)(n - (int)(n * 58728449L) * 8380417L >>> 32);
    }
    
    static int reduce32(final int n) {
        return n - (n + 4194304 >> 23) * 8380417;
    }
    
    static int conditionalAddQ(int n) {
        n += (n >> 31 & 0x7FE001);
        return n;
    }
}