using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace autokodolas_gyorsabb
{
    internal class Program
    {
        static void Main(string[] args)
        {
            long n = long.Parse(Console.ReadLine());

            // Count the number of 1 bits in the binary representation of n
            int oneBits = CountOneBits(n);
            string x = Convert.ToString(n, 2);
            string x_prev = x;
            string x_next = x;

            if (x == "1")
            {
                x_prev = "-1";
                x_next = "10";
            }
            else if (oneBits == 1)
            {
                x_prev = x.Remove(x.Length - 1, 1);
                x_next = x + "0";
            }
            else if (oneBits == x.Length)
            {
                x_prev = "-1";
                x_next = x + "0";
            }
            else
            {
                // x_prev
                char[] ch = x.ToCharArray();
                for (int i = x.Length - 1; 0 < i; i--)
                {
                    if (x[i] == '1' && x[i + 1] == '0')
                    {
                        ch[i] = '0';
                        ch[i + 1] = '1';
                        break;
                    }
                }
                x_prev = new string(ch);
                // x_next
                /*
                long nextCode = n + 1;
                while (CountOneBits(nextCode) != oneBits)
                {
                    nextCode++;
                }

                x_next = Convert.ToString(nextCode, 2);
                */
                ch = x.ToCharArray();
                int j = 0;
                int n_ones = oneBits;
                while ((j < x.Length - 1) && !(x[j] == '0' && x[j+1] == '1'))
                {
                    if (x[j] == '1')
                    {
                        n_ones--;
                    }
                    j++;
                }
                if (j < x.Length - 1) // ennek mindig igaznak kéne lennie
                {
                    ch[j] = '1';
                    ch[j+1] = '0';
                    n_ones--;

                    j += 2;
                    for (; j < x.Length - n_ones; j++)
                    {
                        ch[j] = '0';
                    }
                    for (; j < x.Length; j++)
                    {
                        ch[j] = '1';
                    }
                }
                x_next = new string(ch);
            }

            if (x_prev != "-1")
            {
                Console.WriteLine(Convert.ToInt64(x_prev, 2).ToString());
            }
            else
            {
                Console.WriteLine(x_prev);
            }

            Console.WriteLine(Convert.ToInt64(x_next, 2).ToString());

            Console.ReadKey();
        }

        static int CountOneBits(long n)
        {
            string kettes = Convert.ToString(n, 2);         //átírja kettes számrendszerbe a számot
            int count = 0;

            for (int i = 0; i < kettes.Length; i++)
            {
                if (kettes[i] == '1')
                {
                    count++;
                }
            }
            return count;
        }
    }
}