  Searching a marked item or several marked items from an unsorted database is
a very difficult mathematical problem. Using classical computer, it requires
$O(N=2^n)$ steps to find the target. Using a quantum computer, Grover's
algorithm uses $O(\sqrt{N=2^n})$ steps. In NMR ensemble computing,
Brushweiler's algorithm uses $\log N$ steps. In this Letter, we propose an
algorithm that fetches marked items in an unsorted database directly. It
requires only a single query. It can find a single marked item or multiple
number of items.
