Bitwise XOR Flip

Problem Statement

Bitwise XOR Flip Problem Description Mandy is working on a cybersecurity project that involves basic encryption techniques. She wants to write a program that takes an integer number and performs a bitwise XOR operation to flip all the bits. Help Mandy in this encryption using bitwise operations. Input format: The input consists of an integer N, representing the number to be flipped. Output format: The output displays "Result: " followed by an integer representing the result of the bitwise XOR operation to flip all the bits. Examples Example 1: Input: 0 Output: Result: 255 Explanation: For N = 0 (00000000 in 8-bit binary), flipping all bits results in 11111111, which is 255 in decimal. This is equivalent to 0 XOR 255. Example 2: Input: 255 Output: Result: 0 Explanation: For N = 255 (11111111 in 8-bit binary), flipping all bits results in 00000000, which is 0 in decimal. This is equivalent to 255 XOR 255. Example 3: Input: 135 Output: Result: 120 Explanation: For N = 135 (10000111 in 8-b