Queues and Stacks Hackerrank

using System;
using System.Collections.Generic;
using System.IO;
using System.Collections;

class Solution {
    //Write your code here
    Stack<char> myStack;
    Queue<char> queue;

    public Solution()
    {
        myStack = new Stack<char>();
        queue = new Queue<char>();
    }

    void pushCharacter(char ch){
        myStack.Push(ch);
    }
    void enqueueCharacter(char ch){
        queue.Enqueue(ch);
    }

    char popCharacter(){
        return myStack.Pop();
    }

    char dequeueCharacter(){
        return queue.Dequeue();
    }

    static void Main(String[] args) {
        // read the string s.
        string s = Console.ReadLine();

        // create the Solution class object p.
        Solution obj = new Solution();

        // push/enqueue all the characters of string s to stack.
        foreach (char c in s) {
            obj.pushCharacter(c);
            obj.enqueueCharacter(c);
        }

        bool isPalindrome = true;

        // pop the top character from stack.
        // dequeue the first character from queue.
        // compare both the characters.
        for (int i = 0; i < s.Length / 2; i++) {
            if (obj.popCharacter() != obj.dequeueCharacter()) {
                isPalindrome = false;

                break;
            }
        }

        // finally print whether string s is palindrome or not.
        if (isPalindrome) {
            Console.Write("The word, {0}, is a palindrome.", s);
        } else {
            Console.Write("The word, {0}, is not a palindrome.", s);
        }
    }
}