class Solution:
      def __init__(self):
          self.mystack = list()
          self.myqueue = list()
          return(None)

      def pushCharacter(self, char):
          self.mystack.append(char)

      def popCharacter(self):
          return(self.mystack.pop(-1))

      def enqueueCharacter(self, char):
          self.myqueue.append(char)

      def dequeueCharacter(self):
          return(self.myqueue.pop(0))

#include <iostream>
#include <stack>
#include <queue>

using namespace std;

class Solution {
    //Write your code here
    stack<char> s;
    queue<char> q;
    public:
    void pushCharacter(char i) {
        s.push(i);
    }
    void enqueueCharacter(char i) {
        q.push(i);
    }
    char popCharacter() {
        char temp = s.top();
        s.pop();
        return temp;
    }
    char dequeueCharacter() {
        char temp = q.front();
        q.pop();
        return temp;
    }
};

Stack<Character> stack = new Stack<>();
Queue<Character> queue = new LinkedList<>();

void pushCharacter(char ch) {
    stack.push(ch);
}

void enqueueCharacter(char ch) {
    queue.add(ch);
}

char popCharacter() {
    return stack.pop();
}

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

class Solution:
    def __init__(self):
        self.stack, self.queue = [], []
    def pushCharacter(self,a):
        self.stack.append(a)
    def popCharacter(self):
        return self.stack.pop()
    def enqueueCharacter(self,a):
        self.queue.append(a)
    def dequeueCharacter(self):
        return self.queue.pop(0)