Yes, depending on the underlying data structure that is used, you can simply push the elements to the beginning of the queue, and retrieve them from the back. Here is a possible implementation in Python:

```python
class Queue:
  def __init__(self): 
    self.queue = []
  
  def enqueue(self, item):
    self.queue.append(item)
  
  def dequeue(self):
    try: return self.queue.pop(0)
    except IndexError: return None
```

The method enqueue appends an item at the end of an internal list, and the dequeue method pops (removes and returns) the first element of said internal list, unless it is empty. In that case, it returns None. Thus making a queue.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence