diff --git a/main.cpp b/main.cpp
index 1dd5179..d8cd5fc 100644
--- a/main.cpp
+++ b/main.cpp
@@ -4,27 +4,38 @@
 #include <stdlib.h>
 using namespace std;
 
-int main()
-{
-    const size_t MAX_ELEMENT = 76;
+struct Input {
+    vector<double> numbers;
+    size_t bin_count{};
+};
+
+Input
+input_data(){
+
     size_t number_count;
     cerr << "Enter number count: ";
     cin >> number_count;
 
-    vector<double> numbers(number_count);
+    Input in;
+
+    in.numbers.resize(number_count);
     cerr << "Enter numbers: " << endl;
     for (size_t i=0; i < number_count; i++)
     {
-        cin >> numbers[i];
+        cin >> in.numbers[i];
     }
 
-    size_t bin_count;
+    in.bin_count;
     cerr << "Enter bin count: ";
-    cin >> bin_count;
+    cin >> in.bin_count;
+    return in;
+}
 
-    double min = numbers[0];
-    double max = numbers[0];
-    for(size_t i=0; i < number_count; i++){
+void
+find_minmax(vector<double> numbers, double& min, double& max){
+    min = numbers[0];
+    min = numbers[0];
+    for(size_t i=0; i < sizeof(numbers) / sizeof(numbers[0]); i++){
         if (numbers[i] < min)
         {
             min = numbers[i];
@@ -34,18 +45,29 @@ int main()
             max = numbers[i];
         }
     }
+}
+
+
+int main()
+{
+    const size_t MAX_ELEMENT = 76;
+
+    Input in = input_data();
+
+    double min, max;
+    find_minmax(in.numbers, min, max);
 
-    vector<size_t> bins(bin_count);
-    double bin_size = (max - min) / bin_count;
+    vector<size_t> bins(in.bin_count);
+    double bin_size = (max - min) / in.bin_count;
 
-    for (size_t i = 0; i < number_count; i++)
+    for (size_t i = 0; i < sizeof(in.numbers) / sizeof(in.numbers[0]); i++)
     {
         bool found = false;
-        for (size_t j = 0; (j < bin_count - 1) && !found; j++)
+        for (size_t j = 0; (j < in.bin_count - 1) && !found; j++)
         {
             auto lower_Bound = min + j * bin_size;
             auto upper_Bound = min + (j + 1) * bin_size;
-            if ((lower_Bound <= numbers[i]) && (numbers[i] < upper_Bound))
+            if ((lower_Bound <= in.numbers[i]) && (in.numbers[i] < upper_Bound))
             {
                 bins[j]++;
                 found = true;
@@ -53,23 +75,23 @@ int main()
         }
         if (!found)
         {
-            bins[bin_count - 1]++;
+            bins[in.bin_count - 1]++;
         }
     }
 
     double max_count = bins[0];
-    for (size_t j=0; j < bin_count; j++){
+    for (size_t j=0; j < in.bin_count; j++){
         if (bins[j] > max_count) {
             max_count = bins[j];
         }
     }
-    vector<size_t> height(bin_count);
-    for (size_t j=0; j < bin_count; j++){
+    vector<size_t> height(in.bin_count);
+    for (size_t j=0; j < in.bin_count; j++){
         height[j] = MAX_ELEMENT * (bins[j]/max_count);
     }
 
     if (max_count > MAX_ELEMENT){
-        for  (size_t j=0; j < bin_count; j++)
+        for  (size_t j=0; j < in.bin_count; j++)
             {
                 if (bins[j] < 100) {
                     cout << " ";
@@ -86,7 +108,7 @@ int main()
             }
     }
     else {
-        for  (size_t j=0; j < bin_count; j++)
+        for  (size_t j=0; j < in.bin_count; j++)
             {
                 if (bins[j] < 100) {
                     cout << " ";