Definition: In this task you are given a disfluent question, a proper question and a context. A disfluent question is a question that has some interruptions in it while framing and a proper question is the correct form of the question without any disfluency. Classify whether the question is answerable or not based on the given context.
Input: proper question: How many bits are often in the primes used for RSA private key cryptography algorithms? 
 disfluent question: How many bits are often in the exchange no primes used for RSA private key cryptography algorithms? 
 context: Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example, 512-bit primes are frequently used for RSA and 1024-bit primes are typical for Diffie–Hellman.). RSA relies on the assumption that it is much easier (i.e., more efficient) to perform the multiplication of two (large) numbers x and y than to calculate x and y (assumed coprime) if only the product xy is known. The Diffie–Hellman key exchange relies on the fact that there are efficient algorithms for modular exponentiation, while the reverse operation the discrete logarithm is thought to be a hard problem.

No