diff --git a/BfsJava b/BfsJava
index 943e6b9..09e9ef1 100644
--- a/BfsJava
+++ b/BfsJava
@@ -46,13 +46,13 @@ class Solution
         
         while (!q.isEmpty())
         {
-            Integer node = q.poll();
+            int node = q.poll();
             bfs.add(node); 
  
             // Get all adjacent vertices of the dequeued vertex s
             // If a adjacent has not been visited, then mark it
             // visited and enqueue it
-            for(Integer it: adj.get(node)) {
+            for(int it: adj.get(node)) {
                 if(vis[it] == false) {
                     vis[it] = true; 
                     q.add(it);